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/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 07:09:26,269 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 07:09:26,272 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 07:09:26,289 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 07:09:26,289 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 07:09:26,291 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 07:09:26,293 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 07:09:26,300 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 07:09:26,306 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 07:09:26,307 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 07:09:26,309 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 07:09:26,312 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 07:09:26,312 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 07:09:26,313 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 07:09:26,316 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 07:09:26,317 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 07:09:26,318 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 07:09:26,320 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 07:09:26,324 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 07:09:26,327 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 07:09:26,331 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 07:09:26,332 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 07:09:26,335 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 07:09:26,337 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 07:09:26,339 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 07:09:26,339 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 07:09:26,340 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 07:09:26,342 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 07:09:26,344 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 07:09:26,345 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 07:09:26,345 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 07:09:26,347 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 07:09:26,348 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 07:09:26,349 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 07:09:26,351 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 07:09:26,351 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 07:09:26,352 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 07:09:26,352 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 07:09:26,352 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 07:09:26,354 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 07:09:26,355 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 07:09:26,356 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 07:09:26,374 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 07:09:26,374 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 07:09:26,376 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 07:09:26,376 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 07:09:26,376 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 07:09:26,376 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 07:09:26,377 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 07:09:26,377 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 07:09:26,377 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 07:09:26,377 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 07:09:26,378 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 07:09:26,378 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 07:09:26,378 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 07:09:26,378 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 07:09:26,378 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 07:09:26,379 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 07:09:26,379 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 07:09:26,379 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 07:09:26,379 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 07:09:26,380 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 07:09:26,380 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 07:09:26,380 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 07:09:26,380 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 07:09:26,380 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 07:09:26,381 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 07:09:26,381 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 07:09:26,381 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 07:09:26,381 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 07:09:26,382 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 07:09:26,413 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 07:09:26,428 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 07:09:26,433 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 07:09:26,435 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 07:09:26,435 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 07:09:26,436 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c [2019-09-08 07:09:26,506 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8743ac8b2/885166fcfd394de9b0e312c6e6da3cda/FLAGcefa35247 [2019-09-08 07:09:27,048 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 07:09:27,048 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c [2019-09-08 07:09:27,066 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8743ac8b2/885166fcfd394de9b0e312c6e6da3cda/FLAGcefa35247 [2019-09-08 07:09:27,336 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8743ac8b2/885166fcfd394de9b0e312c6e6da3cda [2019-09-08 07:09:27,346 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 07:09:27,347 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 07:09:27,348 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 07:09:27,348 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 07:09:27,352 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 07:09:27,353 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 07:09:27" (1/1) ... [2019-09-08 07:09:27,355 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b533bf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:09:27, skipping insertion in model container [2019-09-08 07:09:27,356 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 07:09:27" (1/1) ... [2019-09-08 07:09:27,363 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 07:09:27,418 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 07:09:27,879 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 07:09:27,897 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 07:09:27,968 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 07:09:27,989 INFO L192 MainTranslator]: Completed translation [2019-09-08 07:09:27,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:09:27 WrapperNode [2019-09-08 07:09:27,990 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 07:09:27,991 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 07:09:27,991 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 07:09:27,991 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 07:09:28,005 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:09:27" (1/1) ... [2019-09-08 07:09:28,006 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:09:27" (1/1) ... [2019-09-08 07:09:28,019 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:09:27" (1/1) ... [2019-09-08 07:09:28,019 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:09:27" (1/1) ... [2019-09-08 07:09:28,040 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:09:27" (1/1) ... [2019-09-08 07:09:28,057 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:09:27" (1/1) ... [2019-09-08 07:09:28,061 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:09:27" (1/1) ... [2019-09-08 07:09:28,066 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 07:09:28,066 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 07:09:28,066 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 07:09:28,067 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 07:09:28,067 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:09:27" (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 07:09:28,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 07:09:28,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 07:09:28,125 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-08 07:09:28,126 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-08 07:09:28,126 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-08 07:09:28,126 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-08 07:09:28,126 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-08 07:09:28,126 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 07:09:28,127 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-08 07:09:28,127 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 07:09:28,127 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 07:09:28,127 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 07:09:28,127 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 07:09:28,127 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 07:09:28,128 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 07:09:28,128 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 07:09:28,128 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 07:09:28,128 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 07:09:28,128 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 07:09:28,129 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 07:09:28,129 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 07:09:28,129 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 07:09:28,129 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 07:09:28,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 07:09:28,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 07:09:28,950 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 07:09:28,950 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-08 07:09:28,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 07:09:28 BoogieIcfgContainer [2019-09-08 07:09:28,952 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 07:09:28,953 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 07:09:28,954 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 07:09:28,957 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 07:09:28,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 07:09:27" (1/3) ... [2019-09-08 07:09:28,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@233d42a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 07:09:28, skipping insertion in model container [2019-09-08 07:09:28,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:09:27" (2/3) ... [2019-09-08 07:09:28,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@233d42a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 07:09:28, skipping insertion in model container [2019-09-08 07:09:28,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 07:09:28" (3/3) ... [2019-09-08 07:09:28,963 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.2.ufo.UNBOUNDED.pals.c [2019-09-08 07:09:28,973 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 07:09:28,983 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 07:09:29,000 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 07:09:29,032 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 07:09:29,032 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 07:09:29,033 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 07:09:29,033 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 07:09:29,033 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 07:09:29,033 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 07:09:29,034 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 07:09:29,034 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 07:09:29,034 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 07:09:29,063 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states. [2019-09-08 07:09:29,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-08 07:09:29,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:09:29,076 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] [2019-09-08 07:09:29,078 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:09:29,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:09:29,083 INFO L82 PathProgramCache]: Analyzing trace with hash 599968013, now seen corresponding path program 1 times [2019-09-08 07:09:29,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:09:29,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:09:29,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:09:29,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:09:29,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:09:29,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:09:29,556 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 07:09:29,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:09:29,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:09:29,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:09:29,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:09:29,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:09:29,584 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 5 states. [2019-09-08 07:09:29,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:09:29,740 INFO L93 Difference]: Finished difference Result 252 states and 405 transitions. [2019-09-08 07:09:29,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:09:29,742 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-09-08 07:09:29,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:09:29,755 INFO L225 Difference]: With dead ends: 252 [2019-09-08 07:09:29,755 INFO L226 Difference]: Without dead ends: 153 [2019-09-08 07:09:29,760 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:09:29,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-09-08 07:09:29,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-09-08 07:09:29,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-09-08 07:09:29,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 222 transitions. [2019-09-08 07:09:29,816 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 222 transitions. Word has length 56 [2019-09-08 07:09:29,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:09:29,817 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 222 transitions. [2019-09-08 07:09:29,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:09:29,817 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 222 transitions. [2019-09-08 07:09:29,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 07:09:29,821 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:09:29,822 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] [2019-09-08 07:09:29,822 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:09:29,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:09:29,823 INFO L82 PathProgramCache]: Analyzing trace with hash -981393308, now seen corresponding path program 1 times [2019-09-08 07:09:29,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:09:29,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:09:29,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:09:29,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:09:29,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:09:29,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:09:30,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:09:30,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:09:30,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 07:09:30,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 07:09:30,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 07:09:30,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 07:09:30,141 INFO L87 Difference]: Start difference. First operand 153 states and 222 transitions. Second operand 9 states. [2019-09-08 07:09:32,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:09:32,775 INFO L93 Difference]: Finished difference Result 951 states and 1481 transitions. [2019-09-08 07:09:32,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 07:09:32,775 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2019-09-08 07:09:32,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:09:32,789 INFO L225 Difference]: With dead ends: 951 [2019-09-08 07:09:32,789 INFO L226 Difference]: Without dead ends: 861 [2019-09-08 07:09:32,793 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=215, Invalid=655, Unknown=0, NotChecked=0, Total=870 [2019-09-08 07:09:32,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2019-09-08 07:09:32,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 589. [2019-09-08 07:09:32,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-09-08 07:09:32,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 906 transitions. [2019-09-08 07:09:32,893 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 906 transitions. Word has length 82 [2019-09-08 07:09:32,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:09:32,893 INFO L475 AbstractCegarLoop]: Abstraction has 589 states and 906 transitions. [2019-09-08 07:09:32,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 07:09:32,894 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 906 transitions. [2019-09-08 07:09:32,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 07:09:32,899 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:09:32,899 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] [2019-09-08 07:09:32,899 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:09:32,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:09:32,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1956808491, now seen corresponding path program 1 times [2019-09-08 07:09:32,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:09:32,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:09:32,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:09:32,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:09:32,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:09:32,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:09:33,083 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 07:09:33,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:09:33,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 07:09:33,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 07:09:33,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 07:09:33,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:09:33,085 INFO L87 Difference]: Start difference. First operand 589 states and 906 transitions. Second operand 6 states. [2019-09-08 07:09:34,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:09:34,047 INFO L93 Difference]: Finished difference Result 1663 states and 2586 transitions. [2019-09-08 07:09:34,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 07:09:34,048 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-09-08 07:09:34,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:09:34,057 INFO L225 Difference]: With dead ends: 1663 [2019-09-08 07:09:34,057 INFO L226 Difference]: Without dead ends: 1137 [2019-09-08 07:09:34,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:09:34,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2019-09-08 07:09:34,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 863. [2019-09-08 07:09:34,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 863 states. [2019-09-08 07:09:34,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1330 transitions. [2019-09-08 07:09:34,159 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1330 transitions. Word has length 83 [2019-09-08 07:09:34,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:09:34,159 INFO L475 AbstractCegarLoop]: Abstraction has 863 states and 1330 transitions. [2019-09-08 07:09:34,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 07:09:34,160 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1330 transitions. [2019-09-08 07:09:34,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 07:09:34,164 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:09:34,164 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] [2019-09-08 07:09:34,165 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:09:34,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:09:34,165 INFO L82 PathProgramCache]: Analyzing trace with hash 2113374267, now seen corresponding path program 1 times [2019-09-08 07:09:34,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:09:34,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:09:34,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:09:34,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:09:34,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:09:34,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:09:34,282 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 07:09:34,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:09:34,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 07:09:34,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 07:09:34,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 07:09:34,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:09:34,284 INFO L87 Difference]: Start difference. First operand 863 states and 1330 transitions. Second operand 6 states. [2019-09-08 07:09:35,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:09:35,394 INFO L93 Difference]: Finished difference Result 4099 states and 6398 transitions. [2019-09-08 07:09:35,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 07:09:35,395 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2019-09-08 07:09:35,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:09:35,414 INFO L225 Difference]: With dead ends: 4099 [2019-09-08 07:09:35,414 INFO L226 Difference]: Without dead ends: 3299 [2019-09-08 07:09:35,418 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:09:35,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3299 states. [2019-09-08 07:09:35,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3299 to 2477. [2019-09-08 07:09:35,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2477 states. [2019-09-08 07:09:35,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2477 states to 2477 states and 3850 transitions. [2019-09-08 07:09:35,600 INFO L78 Accepts]: Start accepts. Automaton has 2477 states and 3850 transitions. Word has length 84 [2019-09-08 07:09:35,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:09:35,601 INFO L475 AbstractCegarLoop]: Abstraction has 2477 states and 3850 transitions. [2019-09-08 07:09:35,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 07:09:35,601 INFO L276 IsEmpty]: Start isEmpty. Operand 2477 states and 3850 transitions. [2019-09-08 07:09:35,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 07:09:35,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:09:35,605 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] [2019-09-08 07:09:35,605 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:09:35,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:09:35,606 INFO L82 PathProgramCache]: Analyzing trace with hash -611664052, now seen corresponding path program 1 times [2019-09-08 07:09:35,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:09:35,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:09:35,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:09:35,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:09:35,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:09:35,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:09:35,747 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 07:09:35,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:09:35,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 07:09:35,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 07:09:35,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 07:09:35,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:09:35,749 INFO L87 Difference]: Start difference. First operand 2477 states and 3850 transitions. Second operand 6 states. [2019-09-08 07:09:36,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:09:36,978 INFO L93 Difference]: Finished difference Result 12260 states and 19140 transitions. [2019-09-08 07:09:36,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 07:09:36,978 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2019-09-08 07:09:36,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:09:37,033 INFO L225 Difference]: With dead ends: 12260 [2019-09-08 07:09:37,034 INFO L226 Difference]: Without dead ends: 9846 [2019-09-08 07:09:37,044 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-08 07:09:37,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9846 states. [2019-09-08 07:09:37,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9846 to 9792. [2019-09-08 07:09:37,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9792 states. [2019-09-08 07:09:37,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9792 states to 9792 states and 15169 transitions. [2019-09-08 07:09:37,532 INFO L78 Accepts]: Start accepts. Automaton has 9792 states and 15169 transitions. Word has length 85 [2019-09-08 07:09:37,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:09:37,532 INFO L475 AbstractCegarLoop]: Abstraction has 9792 states and 15169 transitions. [2019-09-08 07:09:37,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 07:09:37,533 INFO L276 IsEmpty]: Start isEmpty. Operand 9792 states and 15169 transitions. [2019-09-08 07:09:37,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 07:09:37,536 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:09:37,536 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] [2019-09-08 07:09:37,536 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:09:37,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:09:37,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1246306044, now seen corresponding path program 1 times [2019-09-08 07:09:37,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:09:37,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:09:37,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:09:37,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:09:37,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:09:37,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:09:37,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:09:37,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:09:37,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:09:37,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:09:37,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:09:37,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:09:37,606 INFO L87 Difference]: Start difference. First operand 9792 states and 15169 transitions. Second operand 4 states. [2019-09-08 07:09:38,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:09:38,429 INFO L93 Difference]: Finished difference Result 34818 states and 54725 transitions. [2019-09-08 07:09:38,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 07:09:38,429 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-09-08 07:09:38,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:09:38,565 INFO L225 Difference]: With dead ends: 34818 [2019-09-08 07:09:38,565 INFO L226 Difference]: Without dead ends: 25089 [2019-09-08 07:09:38,618 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:09:38,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25089 states. [2019-09-08 07:09:39,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25089 to 24760. [2019-09-08 07:09:39,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24760 states. [2019-09-08 07:09:39,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24760 states to 24760 states and 38019 transitions. [2019-09-08 07:09:39,937 INFO L78 Accepts]: Start accepts. Automaton has 24760 states and 38019 transitions. Word has length 87 [2019-09-08 07:09:39,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:09:39,940 INFO L475 AbstractCegarLoop]: Abstraction has 24760 states and 38019 transitions. [2019-09-08 07:09:39,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:09:39,940 INFO L276 IsEmpty]: Start isEmpty. Operand 24760 states and 38019 transitions. [2019-09-08 07:09:39,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 07:09:39,946 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:09:39,947 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] [2019-09-08 07:09:39,948 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:09:39,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:09:39,955 INFO L82 PathProgramCache]: Analyzing trace with hash 231318936, now seen corresponding path program 1 times [2019-09-08 07:09:39,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:09:39,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:09:39,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:09:39,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:09:39,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:09:39,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:09:40,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:09:40,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:09:40,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 07:09:40,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 07:09:40,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 07:09:40,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 07:09:40,095 INFO L87 Difference]: Start difference. First operand 24760 states and 38019 transitions. Second operand 9 states. [2019-09-08 07:09:44,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:09:44,041 INFO L93 Difference]: Finished difference Result 43366 states and 66889 transitions. [2019-09-08 07:09:44,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 07:09:44,042 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-08 07:09:44,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:09:44,248 INFO L225 Difference]: With dead ends: 43366 [2019-09-08 07:09:44,248 INFO L226 Difference]: Without dead ends: 33401 [2019-09-08 07:09:44,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=227, Invalid=829, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 07:09:44,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33401 states. [2019-09-08 07:09:45,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33401 to 28096. [2019-09-08 07:09:45,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28096 states. [2019-09-08 07:09:45,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28096 states to 28096 states and 43044 transitions. [2019-09-08 07:09:45,544 INFO L78 Accepts]: Start accepts. Automaton has 28096 states and 43044 transitions. Word has length 87 [2019-09-08 07:09:45,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:09:45,546 INFO L475 AbstractCegarLoop]: Abstraction has 28096 states and 43044 transitions. [2019-09-08 07:09:45,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 07:09:45,546 INFO L276 IsEmpty]: Start isEmpty. Operand 28096 states and 43044 transitions. [2019-09-08 07:09:45,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 07:09:45,550 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:09:45,550 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] [2019-09-08 07:09:45,550 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:09:45,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:09:45,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1277532705, now seen corresponding path program 1 times [2019-09-08 07:09:45,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:09:45,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:09:45,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:09:45,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:09:45,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:09:45,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:09:45,767 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 07:09:45,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:09:45,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 07:09:45,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 07:09:45,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 07:09:45,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 07:09:45,769 INFO L87 Difference]: Start difference. First operand 28096 states and 43044 transitions. Second operand 10 states. [2019-09-08 07:09:51,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:09:51,346 INFO L93 Difference]: Finished difference Result 73537 states and 115020 transitions. [2019-09-08 07:09:51,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-08 07:09:51,347 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2019-09-08 07:09:51,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:09:51,578 INFO L225 Difference]: With dead ends: 73537 [2019-09-08 07:09:51,578 INFO L226 Difference]: Without dead ends: 51926 [2019-09-08 07:09:51,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=479, Invalid=1683, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 07:09:51,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51926 states. [2019-09-08 07:09:54,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51926 to 41840. [2019-09-08 07:09:54,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41840 states. [2019-09-08 07:09:54,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41840 states to 41840 states and 64318 transitions. [2019-09-08 07:09:54,537 INFO L78 Accepts]: Start accepts. Automaton has 41840 states and 64318 transitions. Word has length 88 [2019-09-08 07:09:54,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:09:54,537 INFO L475 AbstractCegarLoop]: Abstraction has 41840 states and 64318 transitions. [2019-09-08 07:09:54,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 07:09:54,537 INFO L276 IsEmpty]: Start isEmpty. Operand 41840 states and 64318 transitions. [2019-09-08 07:09:54,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 07:09:54,540 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:09:54,540 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] [2019-09-08 07:09:54,540 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:09:54,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:09:54,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1631231197, now seen corresponding path program 1 times [2019-09-08 07:09:54,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:09:54,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:09:54,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:09:54,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:09:54,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:09:54,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:09:54,606 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 07:09:54,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:09:54,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:09:54,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:09:54,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:09:54,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:09:54,608 INFO L87 Difference]: Start difference. First operand 41840 states and 64318 transitions. Second operand 5 states. [2019-09-08 07:09:56,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:09:56,602 INFO L93 Difference]: Finished difference Result 96725 states and 150938 transitions. [2019-09-08 07:09:56,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 07:09:56,602 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2019-09-08 07:09:56,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:09:56,932 INFO L225 Difference]: With dead ends: 96725 [2019-09-08 07:09:56,932 INFO L226 Difference]: Without dead ends: 71693 [2019-09-08 07:09:57,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 07:09:57,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71693 states. [2019-09-08 07:10:00,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71693 to 71177. [2019-09-08 07:10:00,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71177 states. [2019-09-08 07:10:00,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71177 states to 71177 states and 110533 transitions. [2019-09-08 07:10:01,003 INFO L78 Accepts]: Start accepts. Automaton has 71177 states and 110533 transitions. Word has length 88 [2019-09-08 07:10:01,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:10:01,004 INFO L475 AbstractCegarLoop]: Abstraction has 71177 states and 110533 transitions. [2019-09-08 07:10:01,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:10:01,004 INFO L276 IsEmpty]: Start isEmpty. Operand 71177 states and 110533 transitions. [2019-09-08 07:10:01,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 07:10:01,008 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:10:01,008 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] [2019-09-08 07:10:01,009 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:10:01,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:10:01,009 INFO L82 PathProgramCache]: Analyzing trace with hash -311105867, now seen corresponding path program 1 times [2019-09-08 07:10:01,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:10:01,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:10:01,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:10:01,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:10:01,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:10:01,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:10:01,191 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 07:10:01,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:10:01,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:10:01,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:10:01,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:10:01,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:10:01,193 INFO L87 Difference]: Start difference. First operand 71177 states and 110533 transitions. Second operand 5 states. [2019-09-08 07:10:06,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:10:06,643 INFO L93 Difference]: Finished difference Result 211989 states and 334736 transitions. [2019-09-08 07:10:06,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:10:06,644 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-09-08 07:10:06,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:10:07,130 INFO L225 Difference]: With dead ends: 211989 [2019-09-08 07:10:07,131 INFO L226 Difference]: Without dead ends: 140826 [2019-09-08 07:10:07,266 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 07:10:07,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140826 states. [2019-09-08 07:10:11,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140826 to 140824. [2019-09-08 07:10:11,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140824 states. [2019-09-08 07:10:11,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140824 states to 140824 states and 215875 transitions. [2019-09-08 07:10:11,469 INFO L78 Accepts]: Start accepts. Automaton has 140824 states and 215875 transitions. Word has length 89 [2019-09-08 07:10:11,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:10:11,469 INFO L475 AbstractCegarLoop]: Abstraction has 140824 states and 215875 transitions. [2019-09-08 07:10:11,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:10:11,469 INFO L276 IsEmpty]: Start isEmpty. Operand 140824 states and 215875 transitions. [2019-09-08 07:10:11,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 07:10:11,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:10:11,475 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] [2019-09-08 07:10:11,476 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:10:11,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:10:11,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1090403345, now seen corresponding path program 1 times [2019-09-08 07:10:11,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:10:11,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:10:11,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:10:11,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:10:11,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:10:11,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:10:11,616 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 07:10:11,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:10:11,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 07:10:11,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 07:10:11,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 07:10:11,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:10:11,618 INFO L87 Difference]: Start difference. First operand 140824 states and 215875 transitions. Second operand 11 states. [2019-09-08 07:10:19,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:10:19,288 INFO L93 Difference]: Finished difference Result 314217 states and 494351 transitions. [2019-09-08 07:10:19,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 07:10:19,289 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 89 [2019-09-08 07:10:19,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:10:19,935 INFO L225 Difference]: With dead ends: 314217 [2019-09-08 07:10:19,936 INFO L226 Difference]: Without dead ends: 195228 [2019-09-08 07:10:20,096 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-09-08 07:10:20,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195228 states. [2019-09-08 07:10:29,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195228 to 157921. [2019-09-08 07:10:29,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157921 states. [2019-09-08 07:10:29,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157921 states to 157921 states and 246389 transitions. [2019-09-08 07:10:29,530 INFO L78 Accepts]: Start accepts. Automaton has 157921 states and 246389 transitions. Word has length 89 [2019-09-08 07:10:29,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:10:29,530 INFO L475 AbstractCegarLoop]: Abstraction has 157921 states and 246389 transitions. [2019-09-08 07:10:29,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 07:10:29,531 INFO L276 IsEmpty]: Start isEmpty. Operand 157921 states and 246389 transitions. [2019-09-08 07:10:29,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 07:10:29,536 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:10:29,536 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] [2019-09-08 07:10:29,537 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:10:29,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:10:29,537 INFO L82 PathProgramCache]: Analyzing trace with hash -249952649, now seen corresponding path program 1 times [2019-09-08 07:10:29,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:10:29,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:10:29,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:10:29,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:10:29,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:10:29,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:10:29,685 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 07:10:29,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:10:29,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 07:10:29,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 07:10:29,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 07:10:29,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:10:29,688 INFO L87 Difference]: Start difference. First operand 157921 states and 246389 transitions. Second operand 11 states. [2019-09-08 07:10:39,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:10:39,579 INFO L93 Difference]: Finished difference Result 365494 states and 584385 transitions. [2019-09-08 07:10:39,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 07:10:39,579 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 89 [2019-09-08 07:10:39,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:10:40,225 INFO L225 Difference]: With dead ends: 365494 [2019-09-08 07:10:40,225 INFO L226 Difference]: Without dead ends: 230244 [2019-09-08 07:10:40,412 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-09-08 07:10:40,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230244 states. [2019-09-08 07:10:45,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230244 to 156061. [2019-09-08 07:10:45,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156061 states. [2019-09-08 07:10:46,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156061 states to 156061 states and 242197 transitions. [2019-09-08 07:10:46,291 INFO L78 Accepts]: Start accepts. Automaton has 156061 states and 242197 transitions. Word has length 89 [2019-09-08 07:10:46,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:10:46,292 INFO L475 AbstractCegarLoop]: Abstraction has 156061 states and 242197 transitions. [2019-09-08 07:10:46,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 07:10:46,292 INFO L276 IsEmpty]: Start isEmpty. Operand 156061 states and 242197 transitions. [2019-09-08 07:10:46,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 07:10:46,296 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:10:46,296 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] [2019-09-08 07:10:46,296 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:10:46,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:10:46,296 INFO L82 PathProgramCache]: Analyzing trace with hash -92550679, now seen corresponding path program 1 times [2019-09-08 07:10:46,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:10:46,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:10:46,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:10:46,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:10:46,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:10:46,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:10:46,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:10:46,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:10:46,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 07:10:46,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 07:10:46,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 07:10:46,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 07:10:46,346 INFO L87 Difference]: Start difference. First operand 156061 states and 242197 transitions. Second operand 3 states. [2019-09-08 07:10:50,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:10:50,217 INFO L93 Difference]: Finished difference Result 233338 states and 361869 transitions. [2019-09-08 07:10:50,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 07:10:50,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-09-08 07:10:50,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:10:50,618 INFO L225 Difference]: With dead ends: 233338 [2019-09-08 07:10:50,618 INFO L226 Difference]: Without dead ends: 156157 [2019-09-08 07:10:54,370 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 07:10:54,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156157 states. [2019-09-08 07:10:58,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156157 to 156063. [2019-09-08 07:10:58,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156063 states. [2019-09-08 07:10:59,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156063 states to 156063 states and 242199 transitions. [2019-09-08 07:10:59,217 INFO L78 Accepts]: Start accepts. Automaton has 156063 states and 242199 transitions. Word has length 90 [2019-09-08 07:10:59,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:10:59,217 INFO L475 AbstractCegarLoop]: Abstraction has 156063 states and 242199 transitions. [2019-09-08 07:10:59,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 07:10:59,218 INFO L276 IsEmpty]: Start isEmpty. Operand 156063 states and 242199 transitions. [2019-09-08 07:10:59,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 07:10:59,221 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:10:59,221 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:10:59,222 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:10:59,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:10:59,222 INFO L82 PathProgramCache]: Analyzing trace with hash 988708442, now seen corresponding path program 1 times [2019-09-08 07:10:59,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:10:59,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:10:59,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:10:59,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:10:59,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:10:59,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:10:59,325 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 07:10:59,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:10:59,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:10:59,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:10:59,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:10:59,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:10:59,326 INFO L87 Difference]: Start difference. First operand 156063 states and 242199 transitions. Second operand 5 states. [2019-09-08 07:11:08,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:11:08,561 INFO L93 Difference]: Finished difference Result 464766 states and 735764 transitions. [2019-09-08 07:11:08,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:11:08,561 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-09-08 07:11:08,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:11:09,347 INFO L225 Difference]: With dead ends: 464766 [2019-09-08 07:11:09,347 INFO L226 Difference]: Without dead ends: 308730 [2019-09-08 07:11:10,711 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 07:11:10,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308730 states. [2019-09-08 07:11:25,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308730 to 308728. [2019-09-08 07:11:25,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308728 states. [2019-09-08 07:11:31,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308728 states to 308728 states and 472650 transitions. [2019-09-08 07:11:31,479 INFO L78 Accepts]: Start accepts. Automaton has 308728 states and 472650 transitions. Word has length 91 [2019-09-08 07:11:31,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:11:31,479 INFO L475 AbstractCegarLoop]: Abstraction has 308728 states and 472650 transitions. [2019-09-08 07:11:31,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:11:31,480 INFO L276 IsEmpty]: Start isEmpty. Operand 308728 states and 472650 transitions. [2019-09-08 07:11:31,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 07:11:31,485 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:11:31,486 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] [2019-09-08 07:11:31,486 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:11:31,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:11:31,486 INFO L82 PathProgramCache]: Analyzing trace with hash -895226652, now seen corresponding path program 1 times [2019-09-08 07:11:31,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:11:31,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:11:31,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:11:31,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:11:31,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:11:31,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:11:31,628 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 07:11:31,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:11:31,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 07:11:31,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 07:11:31,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 07:11:31,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:11:31,629 INFO L87 Difference]: Start difference. First operand 308728 states and 472650 transitions. Second operand 6 states. [2019-09-08 07:11:44,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:11:44,180 INFO L93 Difference]: Finished difference Result 674714 states and 1048398 transitions. [2019-09-08 07:11:44,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:11:44,181 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-09-08 07:11:44,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:11:45,198 INFO L225 Difference]: With dead ends: 674714 [2019-09-08 07:11:45,198 INFO L226 Difference]: Without dead ends: 367016 [2019-09-08 07:11:52,170 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-08 07:11:52,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367016 states. [2019-09-08 07:12:01,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367016 to 230350. [2019-09-08 07:12:01,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230350 states. [2019-09-08 07:12:01,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230350 states to 230350 states and 335842 transitions. [2019-09-08 07:12:01,640 INFO L78 Accepts]: Start accepts. Automaton has 230350 states and 335842 transitions. Word has length 91 [2019-09-08 07:12:01,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:12:01,640 INFO L475 AbstractCegarLoop]: Abstraction has 230350 states and 335842 transitions. [2019-09-08 07:12:01,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 07:12:01,640 INFO L276 IsEmpty]: Start isEmpty. Operand 230350 states and 335842 transitions. [2019-09-08 07:12:01,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 07:12:01,644 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:12:01,645 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] [2019-09-08 07:12:01,645 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:12:01,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:12:01,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1531600991, now seen corresponding path program 1 times [2019-09-08 07:12:01,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:12:01,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:12:01,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:12:01,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:12:01,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:12:01,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:12:01,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:12:01,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:12:01,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:12:01,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:12:01,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:12:01,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:12:01,735 INFO L87 Difference]: Start difference. First operand 230350 states and 335842 transitions. Second operand 4 states. [2019-09-08 07:12:08,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:12:08,493 INFO L93 Difference]: Finished difference Result 287952 states and 419831 transitions. [2019-09-08 07:12:08,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 07:12:08,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-09-08 07:12:08,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:12:08,935 INFO L225 Difference]: With dead ends: 287952 [2019-09-08 07:12:08,936 INFO L226 Difference]: Without dead ends: 173825 [2019-09-08 07:12:09,041 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 07:12:09,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173825 states. [2019-09-08 07:12:22,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173825 to 173825. [2019-09-08 07:12:22,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173825 states. [2019-09-08 07:12:22,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173825 states to 173825 states and 253852 transitions. [2019-09-08 07:12:22,394 INFO L78 Accepts]: Start accepts. Automaton has 173825 states and 253852 transitions. Word has length 91 [2019-09-08 07:12:22,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:12:22,395 INFO L475 AbstractCegarLoop]: Abstraction has 173825 states and 253852 transitions. [2019-09-08 07:12:22,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:12:22,395 INFO L276 IsEmpty]: Start isEmpty. Operand 173825 states and 253852 transitions. [2019-09-08 07:12:22,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 07:12:22,398 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:12:22,398 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] [2019-09-08 07:12:22,398 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:12:22,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:12:22,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1481278384, now seen corresponding path program 1 times [2019-09-08 07:12:22,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:12:22,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:12:22,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:12:22,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:12:22,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:12:22,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:12:22,531 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 07:12:22,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:12:22,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:12:22,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:12:22,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:12:22,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:12:22,533 INFO L87 Difference]: Start difference. First operand 173825 states and 253852 transitions. Second operand 5 states. [2019-09-08 07:12:36,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:12:36,094 INFO L93 Difference]: Finished difference Result 422018 states and 620801 transitions. [2019-09-08 07:12:36,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:12:36,094 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-09-08 07:12:36,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:12:36,766 INFO L225 Difference]: With dead ends: 422018 [2019-09-08 07:12:36,766 INFO L226 Difference]: Without dead ends: 283956 [2019-09-08 07:12:36,928 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 07:12:37,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283956 states. [2019-09-08 07:12:49,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283956 to 278556. [2019-09-08 07:12:49,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278556 states. [2019-09-08 07:12:50,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278556 states to 278556 states and 405840 transitions. [2019-09-08 07:12:50,469 INFO L78 Accepts]: Start accepts. Automaton has 278556 states and 405840 transitions. Word has length 92 [2019-09-08 07:12:50,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:12:50,469 INFO L475 AbstractCegarLoop]: Abstraction has 278556 states and 405840 transitions. [2019-09-08 07:12:50,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:12:50,470 INFO L276 IsEmpty]: Start isEmpty. Operand 278556 states and 405840 transitions. [2019-09-08 07:12:50,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 07:12:50,471 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:12:50,471 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] [2019-09-08 07:12:50,471 INFO L418 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:12:50,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:12:50,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1434429109, now seen corresponding path program 1 times [2019-09-08 07:12:50,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:12:50,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:12:50,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:12:50,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:12:50,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:12:50,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:12:50,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:12:50,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:12:50,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:12:50,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:12:50,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:12:50,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:12:50,575 INFO L87 Difference]: Start difference. First operand 278556 states and 405840 transitions. Second operand 5 states. [2019-09-08 07:13:08,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:13:08,640 INFO L93 Difference]: Finished difference Result 678437 states and 984167 transitions. [2019-09-08 07:13:08,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:13:08,640 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-09-08 07:13:08,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:13:09,606 INFO L225 Difference]: With dead ends: 678437 [2019-09-08 07:13:09,607 INFO L226 Difference]: Without dead ends: 400107 [2019-09-08 07:13:09,883 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 07:13:10,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400107 states. [2019-09-08 07:13:30,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400107 to 365701. [2019-09-08 07:13:30,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365701 states. [2019-09-08 07:13:31,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365701 states to 365701 states and 535182 transitions. [2019-09-08 07:13:31,790 INFO L78 Accepts]: Start accepts. Automaton has 365701 states and 535182 transitions. Word has length 93 [2019-09-08 07:13:31,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:13:31,791 INFO L475 AbstractCegarLoop]: Abstraction has 365701 states and 535182 transitions. [2019-09-08 07:13:31,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:13:31,791 INFO L276 IsEmpty]: Start isEmpty. Operand 365701 states and 535182 transitions. [2019-09-08 07:13:31,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 07:13:31,794 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:13:31,794 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] [2019-09-08 07:13:31,794 INFO L418 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:13:31,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:13:31,794 INFO L82 PathProgramCache]: Analyzing trace with hash 2142671705, now seen corresponding path program 1 times [2019-09-08 07:13:31,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:13:31,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:13:31,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:31,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:13:31,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:31,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:13:31,864 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 07:13:31,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:13:31,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:13:31,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:13:31,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:13:31,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:13:31,866 INFO L87 Difference]: Start difference. First operand 365701 states and 535182 transitions. Second operand 4 states. [2019-09-08 07:14:02,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:14:02,983 INFO L93 Difference]: Finished difference Result 1006157 states and 1508362 transitions. [2019-09-08 07:14:02,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 07:14:02,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-09-08 07:14:02,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:14:04,601 INFO L225 Difference]: With dead ends: 1006157 [2019-09-08 07:14:04,601 INFO L226 Difference]: Without dead ends: 640933 [2019-09-08 07:14:05,859 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:14:06,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640933 states. [2019-09-08 07:14:53,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640933 to 640929. [2019-09-08 07:14:53,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640929 states. [2019-09-08 07:14:56,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640929 states to 640929 states and 918646 transitions. [2019-09-08 07:14:56,427 INFO L78 Accepts]: Start accepts. Automaton has 640929 states and 918646 transitions. Word has length 93 [2019-09-08 07:14:56,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:14:56,427 INFO L475 AbstractCegarLoop]: Abstraction has 640929 states and 918646 transitions. [2019-09-08 07:14:56,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:14:56,428 INFO L276 IsEmpty]: Start isEmpty. Operand 640929 states and 918646 transitions. [2019-09-08 07:14:56,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 07:14:56,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:14:56,430 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] [2019-09-08 07:14:56,430 INFO L418 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:14:56,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:14:56,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1446688205, now seen corresponding path program 1 times [2019-09-08 07:14:56,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:14:56,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:14:56,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:14:56,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:14:56,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:14:56,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:14:56,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:14:56,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:14:56,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 07:14:56,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 07:14:56,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 07:14:56,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 07:14:56,549 INFO L87 Difference]: Start difference. First operand 640929 states and 918646 transitions. Second operand 10 states. [2019-09-08 07:15:37,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:15:37,031 INFO L93 Difference]: Finished difference Result 1232933 states and 1780317 transitions. [2019-09-08 07:15:37,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 07:15:37,031 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2019-09-08 07:15:37,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:15:39,347 INFO L225 Difference]: With dead ends: 1232933 [2019-09-08 07:15:39,348 INFO L226 Difference]: Without dead ends: 834031 [2019-09-08 07:15:39,890 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-09-08 07:15:52,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834031 states. [2019-09-08 07:16:36,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834031 to 686037. [2019-09-08 07:16:36,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686037 states. [2019-09-08 07:16:38,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686037 states to 686037 states and 985760 transitions. [2019-09-08 07:16:38,615 INFO L78 Accepts]: Start accepts. Automaton has 686037 states and 985760 transitions. Word has length 94 [2019-09-08 07:16:38,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:16:38,616 INFO L475 AbstractCegarLoop]: Abstraction has 686037 states and 985760 transitions. [2019-09-08 07:16:38,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 07:16:38,616 INFO L276 IsEmpty]: Start isEmpty. Operand 686037 states and 985760 transitions. [2019-09-08 07:16:38,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 07:16:38,618 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:16:38,619 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] [2019-09-08 07:16:38,619 INFO L418 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:16:38,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:16:38,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1306139595, now seen corresponding path program 1 times [2019-09-08 07:16:38,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:16:38,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:16:38,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:16:38,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:16:38,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:16:38,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:16:38,727 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 07:16:38,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:16:38,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 07:16:38,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 07:16:38,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 07:16:38,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 07:16:38,730 INFO L87 Difference]: Start difference. First operand 686037 states and 985760 transitions. Second operand 9 states. [2019-09-08 07:17:22,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:17:22,832 INFO L93 Difference]: Finished difference Result 1023370 states and 1474439 transitions. [2019-09-08 07:17:22,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 07:17:22,833 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-09-08 07:17:22,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:17:25,739 INFO L225 Difference]: With dead ends: 1023370 [2019-09-08 07:17:25,739 INFO L226 Difference]: Without dead ends: 740737 [2019-09-08 07:17:26,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=227, Invalid=829, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 07:17:26,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740737 states. [2019-09-08 07:18:15,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740737 to 700727. [2019-09-08 07:18:15,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700727 states. [2019-09-08 07:18:18,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700727 states to 700727 states and 1000747 transitions. [2019-09-08 07:18:18,123 INFO L78 Accepts]: Start accepts. Automaton has 700727 states and 1000747 transitions. Word has length 94 [2019-09-08 07:18:18,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:18:18,124 INFO L475 AbstractCegarLoop]: Abstraction has 700727 states and 1000747 transitions. [2019-09-08 07:18:18,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 07:18:18,124 INFO L276 IsEmpty]: Start isEmpty. Operand 700727 states and 1000747 transitions. [2019-09-08 07:18:18,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 07:18:18,127 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:18:18,127 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] [2019-09-08 07:18:18,128 INFO L418 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:18:18,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:18:18,128 INFO L82 PathProgramCache]: Analyzing trace with hash 896462566, now seen corresponding path program 1 times [2019-09-08 07:18:18,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:18:18,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:18:18,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:18:18,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:18:18,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:18:18,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:18:18,221 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 07:18:18,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:18:18,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:18:18,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:18:18,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:18:18,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:18:18,223 INFO L87 Difference]: Start difference. First operand 700727 states and 1000747 transitions. Second operand 5 states.