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.4.2.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 07:18:35,250 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 07:18:35,252 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 07:18:35,264 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 07:18:35,265 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 07:18:35,266 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 07:18:35,267 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 07:18:35,269 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 07:18:35,271 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 07:18:35,271 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 07:18:35,272 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 07:18:35,273 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 07:18:35,274 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 07:18:35,275 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 07:18:35,276 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 07:18:35,277 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 07:18:35,278 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 07:18:35,279 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 07:18:35,280 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 07:18:35,282 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 07:18:35,284 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 07:18:35,285 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 07:18:35,286 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 07:18:35,286 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 07:18:35,289 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 07:18:35,289 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 07:18:35,289 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 07:18:35,290 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 07:18:35,291 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 07:18:35,291 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 07:18:35,292 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 07:18:35,292 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 07:18:35,293 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 07:18:35,294 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 07:18:35,295 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 07:18:35,295 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 07:18:35,296 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 07:18:35,296 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 07:18:35,296 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 07:18:35,297 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 07:18:35,298 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 07:18:35,299 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:18:35,322 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 07:18:35,322 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 07:18:35,325 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 07:18:35,326 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 07:18:35,326 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 07:18:35,327 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 07:18:35,327 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 07:18:35,327 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 07:18:35,327 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 07:18:35,328 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 07:18:35,328 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 07:18:35,328 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 07:18:35,328 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 07:18:35,328 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 07:18:35,329 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 07:18:35,329 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 07:18:35,329 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 07:18:35,330 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 07:18:35,331 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 07:18:35,331 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 07:18:35,331 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 07:18:35,331 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 07:18:35,332 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 07:18:35,332 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 07:18:35,332 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 07:18:35,333 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 07:18:35,333 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 07:18:35,333 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 07:18:35,333 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 07:18:35,383 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 07:18:35,394 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 07:18:35,398 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 07:18:35,399 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 07:18:35,399 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 07:18:35,400 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_floodmax.4.2.ufo.UNBOUNDED.pals.c [2019-09-08 07:18:35,465 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acb990466/9edad525f16e4475a83bcb5d8503c8cb/FLAG9f4ac31bc [2019-09-08 07:18:36,006 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 07:18:36,007 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_floodmax.4.2.ufo.UNBOUNDED.pals.c [2019-09-08 07:18:36,022 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acb990466/9edad525f16e4475a83bcb5d8503c8cb/FLAG9f4ac31bc [2019-09-08 07:18:36,315 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acb990466/9edad525f16e4475a83bcb5d8503c8cb [2019-09-08 07:18:36,328 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 07:18:36,329 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 07:18:36,330 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 07:18:36,330 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 07:18:36,334 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 07:18:36,335 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 07:18:36" (1/1) ... [2019-09-08 07:18:36,338 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44d62613 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:18:36, skipping insertion in model container [2019-09-08 07:18:36,338 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 07:18:36" (1/1) ... [2019-09-08 07:18:36,345 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 07:18:36,404 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 07:18:36,883 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 07:18:36,895 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 07:18:36,973 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 07:18:36,992 INFO L192 MainTranslator]: Completed translation [2019-09-08 07:18:36,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:18:36 WrapperNode [2019-09-08 07:18:36,992 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 07:18:36,993 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 07:18:36,993 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 07:18:36,993 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 07:18:37,003 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:18:36" (1/1) ... [2019-09-08 07:18:37,003 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:18:36" (1/1) ... [2019-09-08 07:18:37,021 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:18:36" (1/1) ... [2019-09-08 07:18:37,021 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:18:36" (1/1) ... [2019-09-08 07:18:37,049 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:18:36" (1/1) ... [2019-09-08 07:18:37,073 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:18:36" (1/1) ... [2019-09-08 07:18:37,078 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:18:36" (1/1) ... [2019-09-08 07:18:37,086 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 07:18:37,087 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 07:18:37,087 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 07:18:37,087 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 07:18:37,088 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:18:36" (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:18:37,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 07:18:37,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 07:18:37,155 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-08 07:18:37,156 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-08 07:18:37,156 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-08 07:18:37,156 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-08 07:18:37,156 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-08 07:18:37,156 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-08 07:18:37,156 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 07:18:37,157 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-08 07:18:37,157 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 07:18:37,157 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 07:18:37,157 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 07:18:37,158 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 07:18:37,158 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 07:18:37,158 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 07:18:37,158 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 07:18:37,158 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 07:18:37,158 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 07:18:37,159 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 07:18:37,159 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 07:18:37,159 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 07:18:37,159 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 07:18:37,159 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 07:18:37,159 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 07:18:37,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 07:18:37,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 07:18:38,627 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 07:18:38,627 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-08 07:18:38,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 07:18:38 BoogieIcfgContainer [2019-09-08 07:18:38,630 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 07:18:38,631 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 07:18:38,631 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 07:18:38,635 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 07:18:38,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 07:18:36" (1/3) ... [2019-09-08 07:18:38,637 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a38dc52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 07:18:38, skipping insertion in model container [2019-09-08 07:18:38,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:18:36" (2/3) ... [2019-09-08 07:18:38,638 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a38dc52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 07:18:38, skipping insertion in model container [2019-09-08 07:18:38,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 07:18:38" (3/3) ... [2019-09-08 07:18:38,642 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.2.ufo.UNBOUNDED.pals.c [2019-09-08 07:18:38,653 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 07:18:38,666 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 07:18:38,683 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 07:18:38,728 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 07:18:38,729 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 07:18:38,729 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 07:18:38,729 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 07:18:38,729 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 07:18:38,729 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 07:18:38,729 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 07:18:38,730 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 07:18:38,730 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 07:18:38,754 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states. [2019-09-08 07:18:38,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 07:18:38,769 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:18:38,770 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:18:38,772 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:18:38,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:18:38,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1109206420, now seen corresponding path program 1 times [2019-09-08 07:18:38,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:18:38,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:18:38,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:18:38,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:18:38,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:18:39,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:18:39,424 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:39,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:18:39,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:18:39,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:18:39,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:18:39,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:18:39,451 INFO L87 Difference]: Start difference. First operand 335 states. Second operand 5 states. [2019-09-08 07:18:39,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:18:39,651 INFO L93 Difference]: Finished difference Result 471 states and 801 transitions. [2019-09-08 07:18:39,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:18:39,653 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-09-08 07:18:39,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:18:39,681 INFO L225 Difference]: With dead ends: 471 [2019-09-08 07:18:39,682 INFO L226 Difference]: Without dead ends: 330 [2019-09-08 07:18:39,690 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:18:39,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-09-08 07:18:39,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2019-09-08 07:18:39,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-09-08 07:18:39,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 531 transitions. [2019-09-08 07:18:39,760 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 531 transitions. Word has length 98 [2019-09-08 07:18:39,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:18:39,761 INFO L475 AbstractCegarLoop]: Abstraction has 330 states and 531 transitions. [2019-09-08 07:18:39,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:18:39,761 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 531 transitions. [2019-09-08 07:18:39,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-08 07:18:39,770 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:18:39,770 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:18:39,770 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:18:39,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:18:39,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1532145528, now seen corresponding path program 1 times [2019-09-08 07:18:39,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:18:39,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:18:39,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:18:39,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:18:39,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:18:39,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:18:40,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:18:40,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:18:40,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 07:18:40,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 07:18:40,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 07:18:40,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:18:40,196 INFO L87 Difference]: Start difference. First operand 330 states and 531 transitions. Second operand 11 states. [2019-09-08 07:18:46,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:18:46,133 INFO L93 Difference]: Finished difference Result 1317 states and 2206 transitions. [2019-09-08 07:18:46,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-08 07:18:46,134 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 139 [2019-09-08 07:18:46,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:18:46,150 INFO L225 Difference]: With dead ends: 1317 [2019-09-08 07:18:46,150 INFO L226 Difference]: Without dead ends: 1185 [2019-09-08 07:18:46,155 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 773 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=512, Invalid=1650, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 07:18:46,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2019-09-08 07:18:46,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 865. [2019-09-08 07:18:46,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2019-09-08 07:18:46,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1401 transitions. [2019-09-08 07:18:46,320 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1401 transitions. Word has length 139 [2019-09-08 07:18:46,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:18:46,322 INFO L475 AbstractCegarLoop]: Abstraction has 865 states and 1401 transitions. [2019-09-08 07:18:46,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 07:18:46,323 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1401 transitions. [2019-09-08 07:18:46,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-08 07:18:46,339 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:18:46,340 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:18:46,341 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:18:46,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:18:46,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1009788152, now seen corresponding path program 1 times [2019-09-08 07:18:46,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:18:46,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:18:46,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:18:46,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:18:46,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:18:46,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:18:46,633 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:46,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:18:46,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 07:18:46,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 07:18:46,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 07:18:46,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:18:46,642 INFO L87 Difference]: Start difference. First operand 865 states and 1401 transitions. Second operand 6 states. [2019-09-08 07:18:49,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:18:49,238 INFO L93 Difference]: Finished difference Result 2694 states and 4364 transitions. [2019-09-08 07:18:49,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 07:18:49,239 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2019-09-08 07:18:49,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:18:49,256 INFO L225 Difference]: With dead ends: 2694 [2019-09-08 07:18:49,256 INFO L226 Difference]: Without dead ends: 2027 [2019-09-08 07:18:49,262 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-08 07:18:49,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2027 states. [2019-09-08 07:18:49,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2027 to 2014. [2019-09-08 07:18:49,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2014 states. [2019-09-08 07:18:49,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2014 states to 2014 states and 3249 transitions. [2019-09-08 07:18:49,395 INFO L78 Accepts]: Start accepts. Automaton has 2014 states and 3249 transitions. Word has length 140 [2019-09-08 07:18:49,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:18:49,397 INFO L475 AbstractCegarLoop]: Abstraction has 2014 states and 3249 transitions. [2019-09-08 07:18:49,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 07:18:49,397 INFO L276 IsEmpty]: Start isEmpty. Operand 2014 states and 3249 transitions. [2019-09-08 07:18:49,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-08 07:18:49,401 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:18:49,401 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:18:49,401 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:18:49,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:18:49,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1742961455, now seen corresponding path program 1 times [2019-09-08 07:18:49,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:18:49,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:18:49,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:18:49,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:18:49,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:18:49,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:18:49,709 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:49,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:18:49,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 07:18:49,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 07:18:49,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 07:18:49,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:18:49,711 INFO L87 Difference]: Start difference. First operand 2014 states and 3249 transitions. Second operand 6 states. [2019-09-08 07:18:51,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:18:51,732 INFO L93 Difference]: Finished difference Result 7571 states and 12209 transitions. [2019-09-08 07:18:51,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 07:18:51,732 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-09-08 07:18:51,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:18:51,772 INFO L225 Difference]: With dead ends: 7571 [2019-09-08 07:18:51,772 INFO L226 Difference]: Without dead ends: 5755 [2019-09-08 07:18:51,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 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:18:51,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5755 states. [2019-09-08 07:18:52,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5755 to 5066. [2019-09-08 07:18:52,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5066 states. [2019-09-08 07:18:52,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5066 states to 5066 states and 8139 transitions. [2019-09-08 07:18:52,033 INFO L78 Accepts]: Start accepts. Automaton has 5066 states and 8139 transitions. Word has length 141 [2019-09-08 07:18:52,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:18:52,034 INFO L475 AbstractCegarLoop]: Abstraction has 5066 states and 8139 transitions. [2019-09-08 07:18:52,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 07:18:52,034 INFO L276 IsEmpty]: Start isEmpty. Operand 5066 states and 8139 transitions. [2019-09-08 07:18:52,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-08 07:18:52,038 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:18:52,039 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:18:52,039 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:18:52,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:18:52,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1127168415, now seen corresponding path program 1 times [2019-09-08 07:18:52,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:18:52,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:18:52,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:18:52,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:18:52,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:18:52,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:18:52,203 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:52,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:18:52,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 07:18:52,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 07:18:52,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 07:18:52,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:18:52,205 INFO L87 Difference]: Start difference. First operand 5066 states and 8139 transitions. Second operand 6 states. [2019-09-08 07:18:53,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:18:53,831 INFO L93 Difference]: Finished difference Result 15250 states and 24422 transitions. [2019-09-08 07:18:53,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 07:18:53,831 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-09-08 07:18:53,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:18:53,892 INFO L225 Difference]: With dead ends: 15250 [2019-09-08 07:18:53,893 INFO L226 Difference]: Without dead ends: 10382 [2019-09-08 07:18:53,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-09-08 07:18:53,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10382 states. [2019-09-08 07:18:54,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10382 to 10342. [2019-09-08 07:18:54,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10342 states. [2019-09-08 07:18:54,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10342 states to 10342 states and 16534 transitions. [2019-09-08 07:18:54,287 INFO L78 Accepts]: Start accepts. Automaton has 10342 states and 16534 transitions. Word has length 142 [2019-09-08 07:18:54,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:18:54,288 INFO L475 AbstractCegarLoop]: Abstraction has 10342 states and 16534 transitions. [2019-09-08 07:18:54,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 07:18:54,288 INFO L276 IsEmpty]: Start isEmpty. Operand 10342 states and 16534 transitions. [2019-09-08 07:18:54,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-08 07:18:54,293 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:18:54,294 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:18:54,294 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:18:54,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:18:54,294 INFO L82 PathProgramCache]: Analyzing trace with hash -834231578, now seen corresponding path program 1 times [2019-09-08 07:18:54,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:18:54,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:18:54,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:18:54,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:18:54,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:18:54,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:18:54,490 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:54,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:18:54,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 07:18:54,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 07:18:54,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 07:18:54,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:18:54,492 INFO L87 Difference]: Start difference. First operand 10342 states and 16534 transitions. Second operand 6 states. [2019-09-08 07:18:57,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:18:57,113 INFO L93 Difference]: Finished difference Result 49577 states and 79334 transitions. [2019-09-08 07:18:57,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 07:18:57,114 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-09-08 07:18:57,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:18:57,376 INFO L225 Difference]: With dead ends: 49577 [2019-09-08 07:18:57,376 INFO L226 Difference]: Without dead ends: 39433 [2019-09-08 07:18:57,423 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 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:18:57,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39433 states. [2019-09-08 07:18:59,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39433 to 31316. [2019-09-08 07:18:59,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31316 states. [2019-09-08 07:18:59,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31316 states to 31316 states and 49962 transitions. [2019-09-08 07:18:59,446 INFO L78 Accepts]: Start accepts. Automaton has 31316 states and 49962 transitions. Word has length 143 [2019-09-08 07:18:59,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:18:59,449 INFO L475 AbstractCegarLoop]: Abstraction has 31316 states and 49962 transitions. [2019-09-08 07:18:59,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 07:18:59,452 INFO L276 IsEmpty]: Start isEmpty. Operand 31316 states and 49962 transitions. [2019-09-08 07:18:59,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-08 07:18:59,459 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:18:59,460 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:18:59,462 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:18:59,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:18:59,462 INFO L82 PathProgramCache]: Analyzing trace with hash 311829015, now seen corresponding path program 1 times [2019-09-08 07:18:59,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:18:59,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:18:59,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:18:59,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:18:59,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:18:59,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:18:59,699 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:59,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:18:59,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 07:18:59,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 07:18:59,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 07:18:59,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:18:59,701 INFO L87 Difference]: Start difference. First operand 31316 states and 49962 transitions. Second operand 11 states. [2019-09-08 07:19:07,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:19:07,305 INFO L93 Difference]: Finished difference Result 45122 states and 71815 transitions. [2019-09-08 07:19:07,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-08 07:19:07,305 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 145 [2019-09-08 07:19:07,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:19:07,463 INFO L225 Difference]: With dead ends: 45122 [2019-09-08 07:19:07,464 INFO L226 Difference]: Without dead ends: 37176 [2019-09-08 07:19:07,498 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1033 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=585, Invalid=2277, Unknown=0, NotChecked=0, Total=2862 [2019-09-08 07:19:07,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37176 states. [2019-09-08 07:19:08,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37176 to 36784. [2019-09-08 07:19:08,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36784 states. [2019-09-08 07:19:08,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36784 states to 36784 states and 58754 transitions. [2019-09-08 07:19:08,919 INFO L78 Accepts]: Start accepts. Automaton has 36784 states and 58754 transitions. Word has length 145 [2019-09-08 07:19:08,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:19:08,920 INFO L475 AbstractCegarLoop]: Abstraction has 36784 states and 58754 transitions. [2019-09-08 07:19:08,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 07:19:08,920 INFO L276 IsEmpty]: Start isEmpty. Operand 36784 states and 58754 transitions. [2019-09-08 07:19:08,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-08 07:19:08,926 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:19:08,927 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:19:08,927 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:19:08,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:19:08,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1376899337, now seen corresponding path program 1 times [2019-09-08 07:19:08,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:19:08,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:19:08,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:19:08,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:19:08,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:19:08,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:19:09,145 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:19:09,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:19:09,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 07:19:09,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 07:19:09,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 07:19:09,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:19:09,148 INFO L87 Difference]: Start difference. First operand 36784 states and 58754 transitions. Second operand 11 states. [2019-09-08 07:19:18,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:19:18,763 INFO L93 Difference]: Finished difference Result 56687 states and 90625 transitions. [2019-09-08 07:19:18,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-08 07:19:18,764 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 145 [2019-09-08 07:19:18,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:19:18,938 INFO L225 Difference]: With dead ends: 56687 [2019-09-08 07:19:18,938 INFO L226 Difference]: Without dead ends: 43748 [2019-09-08 07:19:18,986 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1038 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=599, Invalid=2371, Unknown=0, NotChecked=0, Total=2970 [2019-09-08 07:19:19,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43748 states. [2019-09-08 07:19:20,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43748 to 43545. [2019-09-08 07:19:20,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43545 states. [2019-09-08 07:19:20,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43545 states to 43545 states and 69694 transitions. [2019-09-08 07:19:20,369 INFO L78 Accepts]: Start accepts. Automaton has 43545 states and 69694 transitions. Word has length 145 [2019-09-08 07:19:20,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:19:20,370 INFO L475 AbstractCegarLoop]: Abstraction has 43545 states and 69694 transitions. [2019-09-08 07:19:20,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 07:19:20,370 INFO L276 IsEmpty]: Start isEmpty. Operand 43545 states and 69694 transitions. [2019-09-08 07:19:20,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-08 07:19:20,376 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:19:20,377 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:19:20,377 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:19:20,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:19:20,377 INFO L82 PathProgramCache]: Analyzing trace with hash 146101726, now seen corresponding path program 1 times [2019-09-08 07:19:20,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:19:20,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:19:20,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:19:20,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:19:20,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:19:20,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:19:20,483 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:19:20,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:19:20,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:19:20,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:19:20,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:19:20,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:19:20,485 INFO L87 Difference]: Start difference. First operand 43545 states and 69694 transitions. Second operand 4 states. [2019-09-08 07:19:22,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:19:22,811 INFO L93 Difference]: Finished difference Result 158446 states and 255956 transitions. [2019-09-08 07:19:22,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 07:19:22,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-09-08 07:19:22,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:19:23,292 INFO L225 Difference]: With dead ends: 158446 [2019-09-08 07:19:23,293 INFO L226 Difference]: Without dead ends: 115099 [2019-09-08 07:19:23,452 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:19:23,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115099 states. [2019-09-08 07:19:28,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115099 to 114106. [2019-09-08 07:19:28,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114106 states. [2019-09-08 07:19:28,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114106 states to 114106 states and 181652 transitions. [2019-09-08 07:19:28,675 INFO L78 Accepts]: Start accepts. Automaton has 114106 states and 181652 transitions. Word has length 145 [2019-09-08 07:19:28,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:19:28,675 INFO L475 AbstractCegarLoop]: Abstraction has 114106 states and 181652 transitions. [2019-09-08 07:19:28,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:19:28,675 INFO L276 IsEmpty]: Start isEmpty. Operand 114106 states and 181652 transitions. [2019-09-08 07:19:28,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-08 07:19:28,681 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:19:28,681 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:19:28,682 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:19:28,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:19:28,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1790577429, now seen corresponding path program 1 times [2019-09-08 07:19:28,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:19:28,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:19:28,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:19:28,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:19:28,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:19:28,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:19:28,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:19:28,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:19:28,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 07:19:28,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 07:19:28,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 07:19:28,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:19:28,926 INFO L87 Difference]: Start difference. First operand 114106 states and 181652 transitions. Second operand 11 states. [2019-09-08 07:19:31,984 WARN L188 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2019-09-08 07:19:39,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:19:39,133 INFO L93 Difference]: Finished difference Result 190289 states and 304664 transitions. [2019-09-08 07:19:39,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-08 07:19:39,134 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 145 [2019-09-08 07:19:39,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:19:39,739 INFO L225 Difference]: With dead ends: 190289 [2019-09-08 07:19:39,739 INFO L226 Difference]: Without dead ends: 138930 [2019-09-08 07:19:39,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=486, Invalid=1676, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 07:19:40,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138930 states. [2019-09-08 07:19:46,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138930 to 138001. [2019-09-08 07:19:46,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138001 states. [2019-09-08 07:19:46,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138001 states to 138001 states and 220072 transitions. [2019-09-08 07:19:46,695 INFO L78 Accepts]: Start accepts. Automaton has 138001 states and 220072 transitions. Word has length 145 [2019-09-08 07:19:46,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:19:46,696 INFO L475 AbstractCegarLoop]: Abstraction has 138001 states and 220072 transitions. [2019-09-08 07:19:46,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 07:19:46,696 INFO L276 IsEmpty]: Start isEmpty. Operand 138001 states and 220072 transitions. [2019-09-08 07:19:46,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 07:19:46,702 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:19:46,703 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:19:46,703 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:19:46,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:19:46,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1588333813, now seen corresponding path program 1 times [2019-09-08 07:19:46,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:19:46,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:19:46,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:19:46,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:19:46,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:19:46,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:19:46,925 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:19:46,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:19:46,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 07:19:46,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 07:19:46,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 07:19:46,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-09-08 07:19:46,927 INFO L87 Difference]: Start difference. First operand 138001 states and 220072 transitions. Second operand 12 states. [2019-09-08 07:19:57,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:19:57,470 INFO L93 Difference]: Finished difference Result 195934 states and 312459 transitions. [2019-09-08 07:19:57,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 07:19:57,470 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 146 [2019-09-08 07:19:57,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:19:57,877 INFO L225 Difference]: With dead ends: 195934 [2019-09-08 07:19:57,877 INFO L226 Difference]: Without dead ends: 144311 [2019-09-08 07:19:57,966 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=411, Invalid=1149, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 07:19:58,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144311 states. [2019-09-08 07:20:03,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144311 to 144042. [2019-09-08 07:20:03,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144042 states. [2019-09-08 07:20:03,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144042 states to 144042 states and 229710 transitions. [2019-09-08 07:20:03,528 INFO L78 Accepts]: Start accepts. Automaton has 144042 states and 229710 transitions. Word has length 146 [2019-09-08 07:20:03,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:20:03,529 INFO L475 AbstractCegarLoop]: Abstraction has 144042 states and 229710 transitions. [2019-09-08 07:20:03,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 07:20:03,529 INFO L276 IsEmpty]: Start isEmpty. Operand 144042 states and 229710 transitions. [2019-09-08 07:20:03,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 07:20:03,534 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:20:03,534 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:20:03,535 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:20:03,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:20:03,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1862627981, now seen corresponding path program 1 times [2019-09-08 07:20:03,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:20:03,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:20:03,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:20:03,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:20:03,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:20:03,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:20:03,667 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:20:03,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:20:03,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 07:20:03,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 07:20:03,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 07:20:03,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 07:20:03,669 INFO L87 Difference]: Start difference. First operand 144042 states and 229710 transitions. Second operand 7 states. [2019-09-08 07:20:11,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:20:11,461 INFO L93 Difference]: Finished difference Result 278992 states and 446552 transitions. [2019-09-08 07:20:11,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 07:20:11,462 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 146 [2019-09-08 07:20:11,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:20:11,922 INFO L225 Difference]: With dead ends: 278992 [2019-09-08 07:20:11,922 INFO L226 Difference]: Without dead ends: 162151 [2019-09-08 07:20:12,066 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-08 07:20:12,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162151 states. [2019-09-08 07:20:17,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162151 to 161990. [2019-09-08 07:20:17,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161990 states. [2019-09-08 07:20:17,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161990 states to 161990 states and 259392 transitions. [2019-09-08 07:20:17,452 INFO L78 Accepts]: Start accepts. Automaton has 161990 states and 259392 transitions. Word has length 146 [2019-09-08 07:20:17,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:20:17,453 INFO L475 AbstractCegarLoop]: Abstraction has 161990 states and 259392 transitions. [2019-09-08 07:20:17,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 07:20:17,453 INFO L276 IsEmpty]: Start isEmpty. Operand 161990 states and 259392 transitions. [2019-09-08 07:20:17,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-08 07:20:17,460 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:20:17,461 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:20:17,461 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:20:17,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:20:17,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1985707213, now seen corresponding path program 1 times [2019-09-08 07:20:17,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:20:17,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:20:17,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:20:17,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:20:17,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:20:17,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:20:17,707 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:20:17,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:20:17,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:20:17,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:20:17,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:20:17,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:20:17,709 INFO L87 Difference]: Start difference. First operand 161990 states and 259392 transitions. Second operand 5 states. [2019-09-08 07:20:27,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:20:27,751 INFO L93 Difference]: Finished difference Result 483559 states and 783271 transitions. [2019-09-08 07:20:27,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:20:27,751 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-09-08 07:20:27,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:20:29,345 INFO L225 Difference]: With dead ends: 483559 [2019-09-08 07:20:29,345 INFO L226 Difference]: Without dead ends: 321585 [2019-09-08 07:20:29,581 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:20:29,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321585 states. [2019-09-08 07:20:41,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321585 to 321583. [2019-09-08 07:20:41,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321583 states. [2019-09-08 07:20:42,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321583 states to 321583 states and 510657 transitions. [2019-09-08 07:20:42,436 INFO L78 Accepts]: Start accepts. Automaton has 321583 states and 510657 transitions. Word has length 148 [2019-09-08 07:20:42,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:20:42,436 INFO L475 AbstractCegarLoop]: Abstraction has 321583 states and 510657 transitions. [2019-09-08 07:20:42,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:20:42,436 INFO L276 IsEmpty]: Start isEmpty. Operand 321583 states and 510657 transitions. [2019-09-08 07:20:42,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-08 07:20:42,444 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:20:42,444 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:20:42,444 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:20:42,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:20:42,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1735540910, now seen corresponding path program 1 times [2019-09-08 07:20:42,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:20:42,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:20:42,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:20:42,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:20:42,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:20:42,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:20:42,576 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:20:42,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:20:42,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:20:42,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:20:42,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:20:42,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:20:42,578 INFO L87 Difference]: Start difference. First operand 321583 states and 510657 transitions. Second operand 5 states. [2019-09-08 07:20:57,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:20:57,913 INFO L93 Difference]: Finished difference Result 757177 states and 1195957 transitions. [2019-09-08 07:20:57,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:20:57,913 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-09-08 07:20:57,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:20:59,168 INFO L225 Difference]: With dead ends: 757177 [2019-09-08 07:20:59,168 INFO L226 Difference]: Without dead ends: 435975 [2019-09-08 07:20:59,625 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:21:00,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435975 states. [2019-09-08 07:21:18,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435975 to 408277. [2019-09-08 07:21:18,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408277 states. [2019-09-08 07:21:19,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408277 states to 408277 states and 650693 transitions. [2019-09-08 07:21:19,669 INFO L78 Accepts]: Start accepts. Automaton has 408277 states and 650693 transitions. Word has length 150 [2019-09-08 07:21:19,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:21:19,670 INFO L475 AbstractCegarLoop]: Abstraction has 408277 states and 650693 transitions. [2019-09-08 07:21:19,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:21:19,670 INFO L276 IsEmpty]: Start isEmpty. Operand 408277 states and 650693 transitions. [2019-09-08 07:21:19,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-08 07:21:19,682 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:21:19,683 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:21:19,683 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:21:19,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:21:19,684 INFO L82 PathProgramCache]: Analyzing trace with hash 281113469, now seen corresponding path program 1 times [2019-09-08 07:21:19,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:21:19,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:21:19,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:21:19,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:21:19,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:21:19,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:21:21,309 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:21:21,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:21:21,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 07:21:21,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 07:21:21,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 07:21:21,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 07:21:21,311 INFO L87 Difference]: Start difference. First operand 408277 states and 650693 transitions. Second operand 10 states. [2019-09-08 07:21:40,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:21:40,730 INFO L93 Difference]: Finished difference Result 722545 states and 1163567 transitions. [2019-09-08 07:21:40,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 07:21:40,730 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 152 [2019-09-08 07:21:40,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:21:42,297 INFO L225 Difference]: With dead ends: 722545 [2019-09-08 07:21:42,298 INFO L226 Difference]: Without dead ends: 548921 [2019-09-08 07:21:42,574 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-09-08 07:21:42,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548921 states. [2019-09-08 07:22:03,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548921 to 411237. [2019-09-08 07:22:03,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411237 states. [2019-09-08 07:22:05,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411237 states to 411237 states and 655272 transitions. [2019-09-08 07:22:05,849 INFO L78 Accepts]: Start accepts. Automaton has 411237 states and 655272 transitions. Word has length 152 [2019-09-08 07:22:05,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:22:05,850 INFO L475 AbstractCegarLoop]: Abstraction has 411237 states and 655272 transitions. [2019-09-08 07:22:05,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 07:22:05,850 INFO L276 IsEmpty]: Start isEmpty. Operand 411237 states and 655272 transitions. [2019-09-08 07:22:05,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-08 07:22:05,866 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:22:05,867 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:22:05,867 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:22:05,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:22:05,869 INFO L82 PathProgramCache]: Analyzing trace with hash 555873083, now seen corresponding path program 1 times [2019-09-08 07:22:05,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:22:05,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:22:05,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:22:05,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:22:05,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:22:05,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:22:06,052 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:22:06,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:22:06,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:22:06,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:22:06,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:22:06,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:22:06,056 INFO L87 Difference]: Start difference. First operand 411237 states and 655272 transitions. Second operand 5 states. [2019-09-08 07:22:32,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:22:32,975 INFO L93 Difference]: Finished difference Result 1012433 states and 1622240 transitions. [2019-09-08 07:22:32,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:22:32,975 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 152 [2019-09-08 07:22:32,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:22:35,311 INFO L225 Difference]: With dead ends: 1012433 [2019-09-08 07:22:35,311 INFO L226 Difference]: Without dead ends: 666931 [2019-09-08 07:22:35,843 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:22:36,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666931 states. [2019-09-08 07:23:26,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666931 to 666789. [2019-09-08 07:23:26,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666789 states. [2019-09-08 07:23:29,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666789 states to 666789 states and 1055058 transitions. [2019-09-08 07:23:29,796 INFO L78 Accepts]: Start accepts. Automaton has 666789 states and 1055058 transitions. Word has length 152 [2019-09-08 07:23:29,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:23:29,797 INFO L475 AbstractCegarLoop]: Abstraction has 666789 states and 1055058 transitions. [2019-09-08 07:23:29,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:23:29,797 INFO L276 IsEmpty]: Start isEmpty. Operand 666789 states and 1055058 transitions. [2019-09-08 07:23:29,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-08 07:23:29,802 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:23:29,802 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:23:29,803 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:23:29,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:23:29,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1874141699, now seen corresponding path program 1 times [2019-09-08 07:23:29,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:23:29,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:23:29,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:23:29,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:23:29,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:23:29,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:23:29,998 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:23:29,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:23:29,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:23:29,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:23:29,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:23:30,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:23:30,000 INFO L87 Difference]: Start difference. First operand 666789 states and 1055058 transitions. Second operand 5 states. [2019-09-08 07:24:36,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:24:36,184 INFO L93 Difference]: Finished difference Result 1989747 states and 3186628 transitions. [2019-09-08 07:24:36,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:24:36,186 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2019-09-08 07:24:36,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:24:40,551 INFO L225 Difference]: With dead ends: 1989747 [2019-09-08 07:24:40,552 INFO L226 Difference]: Without dead ends: 1322984 [2019-09-08 07:24:42,959 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:24:43,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322984 states.