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_opt-floodmax.5.ufo.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 08:27:12,380 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 08:27:12,383 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 08:27:12,401 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 08:27:12,402 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 08:27:12,403 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 08:27:12,405 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 08:27:12,414 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 08:27:12,418 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 08:27:12,421 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 08:27:12,423 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 08:27:12,425 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 08:27:12,426 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 08:27:12,427 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 08:27:12,430 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 08:27:12,431 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 08:27:12,432 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 08:27:12,434 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 08:27:12,435 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 08:27:12,439 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 08:27:12,440 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 08:27:12,440 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 08:27:12,441 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 08:27:12,442 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 08:27:12,444 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 08:27:12,444 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 08:27:12,444 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 08:27:12,445 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 08:27:12,446 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 08:27:12,447 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 08:27:12,447 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 08:27:12,448 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 08:27:12,448 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 08:27:12,449 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 08:27:12,450 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 08:27:12,450 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 08:27:12,451 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 08:27:12,451 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 08:27:12,451 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 08:27:12,452 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 08:27:12,453 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 08:27:12,454 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 08:27:12,484 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 08:27:12,485 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 08:27:12,486 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 08:27:12,486 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 08:27:12,486 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 08:27:12,487 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 08:27:12,487 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 08:27:12,489 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 08:27:12,489 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 08:27:12,489 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 08:27:12,489 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 08:27:12,489 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 08:27:12,490 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 08:27:12,490 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 08:27:12,491 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 08:27:12,491 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 08:27:12,492 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 08:27:12,492 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 08:27:12,492 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 08:27:12,492 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 08:27:12,492 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 08:27:12,493 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 08:27:12,493 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 08:27:12,493 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 08:27:12,493 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 08:27:12,493 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 08:27:12,494 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 08:27:12,494 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 08:27:12,494 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 08:27:12,545 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 08:27:12,561 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 08:27:12,566 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 08:27:12,567 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 08:27:12,568 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 08:27:12,568 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.5.ufo.BOUNDED-10.pals.c [2019-09-08 08:27:12,633 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/406718c47/1ab6cc74fc9f472b947131ddec33bf65/FLAG7358ac8de [2019-09-08 08:27:13,339 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 08:27:13,341 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.5.ufo.BOUNDED-10.pals.c [2019-09-08 08:27:13,371 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/406718c47/1ab6cc74fc9f472b947131ddec33bf65/FLAG7358ac8de [2019-09-08 08:27:13,506 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/406718c47/1ab6cc74fc9f472b947131ddec33bf65 [2019-09-08 08:27:13,517 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 08:27:13,518 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 08:27:13,520 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 08:27:13,520 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 08:27:13,523 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 08:27:13,524 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 08:27:13" (1/1) ... [2019-09-08 08:27:13,527 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@790e915c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:27:13, skipping insertion in model container [2019-09-08 08:27:13,527 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 08:27:13" (1/1) ... [2019-09-08 08:27:13,535 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 08:27:13,611 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 08:27:14,250 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 08:27:14,283 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 08:27:14,437 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 08:27:14,466 INFO L192 MainTranslator]: Completed translation [2019-09-08 08:27:14,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:27:14 WrapperNode [2019-09-08 08:27:14,467 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 08:27:14,468 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 08:27:14,468 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 08:27:14,468 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 08:27:14,485 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:27:14" (1/1) ... [2019-09-08 08:27:14,486 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:27:14" (1/1) ... [2019-09-08 08:27:14,520 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:27:14" (1/1) ... [2019-09-08 08:27:14,520 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:27:14" (1/1) ... [2019-09-08 08:27:14,587 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:27:14" (1/1) ... [2019-09-08 08:27:14,643 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:27:14" (1/1) ... [2019-09-08 08:27:14,659 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:27:14" (1/1) ... [2019-09-08 08:27:14,676 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 08:27:14,677 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 08:27:14,677 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 08:27:14,677 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 08:27:14,683 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:27:14" (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 08:27:14,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 08:27:14,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 08:27:14,739 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-08 08:27:14,739 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-08 08:27:14,740 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-08 08:27:14,740 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-08 08:27:14,740 INFO L138 BoogieDeclarations]: Found implementation of procedure node5 [2019-09-08 08:27:14,740 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-08 08:27:14,740 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-08 08:27:14,740 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 08:27:14,741 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-08 08:27:14,741 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 08:27:14,741 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 08:27:14,741 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 08:27:14,741 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 08:27:14,742 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 08:27:14,742 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 08:27:14,742 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 08:27:14,742 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 08:27:14,742 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 08:27:14,743 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 08:27:14,743 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 08:27:14,744 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 08:27:14,744 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 08:27:14,744 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 08:27:14,744 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 08:27:14,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 08:27:14,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 08:27:17,064 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 08:27:17,065 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-08 08:27:17,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 08:27:17 BoogieIcfgContainer [2019-09-08 08:27:17,067 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 08:27:17,068 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 08:27:17,068 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 08:27:17,072 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 08:27:17,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 08:27:13" (1/3) ... [2019-09-08 08:27:17,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e39ce5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 08:27:17, skipping insertion in model container [2019-09-08 08:27:17,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:27:14" (2/3) ... [2019-09-08 08:27:17,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e39ce5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 08:27:17, skipping insertion in model container [2019-09-08 08:27:17,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 08:27:17" (3/3) ... [2019-09-08 08:27:17,076 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.5.ufo.BOUNDED-10.pals.c [2019-09-08 08:27:17,087 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 08:27:17,097 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 08:27:17,115 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 08:27:17,154 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 08:27:17,155 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 08:27:17,155 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 08:27:17,155 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 08:27:17,155 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 08:27:17,156 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 08:27:17,156 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 08:27:17,156 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 08:27:17,156 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 08:27:17,191 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states. [2019-09-08 08:27:17,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 08:27:17,235 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:27:17,236 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:27:17,239 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:27:17,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:27:17,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1836203499, now seen corresponding path program 1 times [2019-09-08 08:27:17,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:27:17,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:27:17,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:27:17,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:27:17,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:27:17,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:27:18,013 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 08:27:18,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:27:18,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:27:18,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:27:18,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:27:18,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:27:18,042 INFO L87 Difference]: Start difference. First operand 767 states. Second operand 5 states. [2019-09-08 08:27:18,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:27:18,338 INFO L93 Difference]: Finished difference Result 981 states and 1739 transitions. [2019-09-08 08:27:18,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 08:27:18,340 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 181 [2019-09-08 08:27:18,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:27:18,437 INFO L225 Difference]: With dead ends: 981 [2019-09-08 08:27:18,437 INFO L226 Difference]: Without dead ends: 762 [2019-09-08 08:27:18,443 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 08:27:18,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2019-09-08 08:27:18,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 762. [2019-09-08 08:27:18,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 762 states. [2019-09-08 08:27:18,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 1316 transitions. [2019-09-08 08:27:18,541 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 1316 transitions. Word has length 181 [2019-09-08 08:27:18,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:27:18,542 INFO L475 AbstractCegarLoop]: Abstraction has 762 states and 1316 transitions. [2019-09-08 08:27:18,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:27:18,543 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1316 transitions. [2019-09-08 08:27:18,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 08:27:18,550 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:27:18,551 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:27:18,551 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:27:18,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:27:18,552 INFO L82 PathProgramCache]: Analyzing trace with hash 453327305, now seen corresponding path program 1 times [2019-09-08 08:27:18,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:27:18,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:27:18,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:27:18,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:27:18,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:27:18,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:27:18,902 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 08:27:18,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:27:18,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:27:18,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:27:18,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:27:18,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:27:18,908 INFO L87 Difference]: Start difference. First operand 762 states and 1316 transitions. Second operand 5 states. [2019-09-08 08:27:21,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:27:21,773 INFO L93 Difference]: Finished difference Result 1170 states and 1987 transitions. [2019-09-08 08:27:21,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 08:27:21,774 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2019-09-08 08:27:21,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:27:21,783 INFO L225 Difference]: With dead ends: 1170 [2019-09-08 08:27:21,784 INFO L226 Difference]: Without dead ends: 965 [2019-09-08 08:27:21,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:27:21,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2019-09-08 08:27:21,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 953. [2019-09-08 08:27:21,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2019-09-08 08:27:21,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1626 transitions. [2019-09-08 08:27:21,852 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1626 transitions. Word has length 245 [2019-09-08 08:27:21,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:27:21,855 INFO L475 AbstractCegarLoop]: Abstraction has 953 states and 1626 transitions. [2019-09-08 08:27:21,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:27:21,856 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1626 transitions. [2019-09-08 08:27:21,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-08 08:27:21,864 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:27:21,865 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:27:21,865 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:27:21,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:27:21,866 INFO L82 PathProgramCache]: Analyzing trace with hash 976666609, now seen corresponding path program 1 times [2019-09-08 08:27:21,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:27:21,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:27:21,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:27:21,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:27:21,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:27:21,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:27:22,188 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 08:27:22,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:27:22,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:27:22,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:27:22,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:27:22,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:27:22,201 INFO L87 Difference]: Start difference. First operand 953 states and 1626 transitions. Second operand 5 states. [2019-09-08 08:27:24,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:27:24,923 INFO L93 Difference]: Finished difference Result 1731 states and 2894 transitions. [2019-09-08 08:27:24,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 08:27:24,925 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 249 [2019-09-08 08:27:24,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:27:24,945 INFO L225 Difference]: With dead ends: 1731 [2019-09-08 08:27:24,945 INFO L226 Difference]: Without dead ends: 1335 [2019-09-08 08:27:24,949 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 08:27:24,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2019-09-08 08:27:25,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1327. [2019-09-08 08:27:25,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1327 states. [2019-09-08 08:27:25,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1327 states to 1327 states and 2234 transitions. [2019-09-08 08:27:25,022 INFO L78 Accepts]: Start accepts. Automaton has 1327 states and 2234 transitions. Word has length 249 [2019-09-08 08:27:25,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:27:25,023 INFO L475 AbstractCegarLoop]: Abstraction has 1327 states and 2234 transitions. [2019-09-08 08:27:25,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:27:25,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1327 states and 2234 transitions. [2019-09-08 08:27:25,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-08 08:27:25,029 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:27:25,030 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:27:25,030 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:27:25,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:27:25,031 INFO L82 PathProgramCache]: Analyzing trace with hash -806730487, now seen corresponding path program 1 times [2019-09-08 08:27:25,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:27:25,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:27:25,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:27:25,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:27:25,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:27:25,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:27:25,314 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 08:27:25,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:27:25,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:27:25,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:27:25,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:27:25,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:27:25,317 INFO L87 Difference]: Start difference. First operand 1327 states and 2234 transitions. Second operand 5 states. [2019-09-08 08:27:28,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:27:28,788 INFO L93 Difference]: Finished difference Result 2839 states and 4688 transitions. [2019-09-08 08:27:28,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 08:27:28,792 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 253 [2019-09-08 08:27:28,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:27:28,810 INFO L225 Difference]: With dead ends: 2839 [2019-09-08 08:27:28,810 INFO L226 Difference]: Without dead ends: 2069 [2019-09-08 08:27:28,814 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 08:27:28,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2069 states. [2019-09-08 08:27:28,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2069 to 2055. [2019-09-08 08:27:28,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2055 states. [2019-09-08 08:27:28,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 2055 states and 3410 transitions. [2019-09-08 08:27:28,961 INFO L78 Accepts]: Start accepts. Automaton has 2055 states and 3410 transitions. Word has length 253 [2019-09-08 08:27:28,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:27:28,962 INFO L475 AbstractCegarLoop]: Abstraction has 2055 states and 3410 transitions. [2019-09-08 08:27:28,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:27:28,962 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 3410 transitions. [2019-09-08 08:27:28,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-08 08:27:28,969 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:27:28,969 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:27:28,970 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:27:28,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:27:28,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1656053041, now seen corresponding path program 1 times [2019-09-08 08:27:28,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:27:28,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:27:28,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:27:28,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:27:28,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:27:29,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:27:29,231 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 08:27:29,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:27:29,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:27:29,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:27:29,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:27:29,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:27:29,234 INFO L87 Difference]: Start difference. First operand 2055 states and 3410 transitions. Second operand 5 states. [2019-09-08 08:27:32,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:27:32,024 INFO L93 Difference]: Finished difference Result 4995 states and 8156 transitions. [2019-09-08 08:27:32,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 08:27:32,026 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 257 [2019-09-08 08:27:32,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:27:32,055 INFO L225 Difference]: With dead ends: 4995 [2019-09-08 08:27:32,055 INFO L226 Difference]: Without dead ends: 3497 [2019-09-08 08:27:32,063 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 08:27:32,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3497 states. [2019-09-08 08:27:32,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3497 to 3471. [2019-09-08 08:27:32,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3471 states. [2019-09-08 08:27:32,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3471 states to 3471 states and 5682 transitions. [2019-09-08 08:27:32,243 INFO L78 Accepts]: Start accepts. Automaton has 3471 states and 5682 transitions. Word has length 257 [2019-09-08 08:27:32,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:27:32,244 INFO L475 AbstractCegarLoop]: Abstraction has 3471 states and 5682 transitions. [2019-09-08 08:27:32,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:27:32,244 INFO L276 IsEmpty]: Start isEmpty. Operand 3471 states and 5682 transitions. [2019-09-08 08:27:32,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-08 08:27:32,254 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:27:32,255 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:27:32,255 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:27:32,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:27:32,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1073111479, now seen corresponding path program 1 times [2019-09-08 08:27:32,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:27:32,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:27:32,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:27:32,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:27:32,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:27:32,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:27:32,491 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 08:27:32,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:27:32,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:27:32,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:27:32,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:27:32,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:27:32,493 INFO L87 Difference]: Start difference. First operand 3471 states and 5682 transitions. Second operand 5 states. [2019-09-08 08:27:35,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:27:35,277 INFO L93 Difference]: Finished difference Result 9187 states and 14852 transitions. [2019-09-08 08:27:35,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 08:27:35,277 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 261 [2019-09-08 08:27:35,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:27:35,314 INFO L225 Difference]: With dead ends: 9187 [2019-09-08 08:27:35,315 INFO L226 Difference]: Without dead ends: 6273 [2019-09-08 08:27:35,326 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 08:27:35,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6273 states. [2019-09-08 08:27:35,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6273 to 6223. [2019-09-08 08:27:35,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6223 states. [2019-09-08 08:27:35,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6223 states to 6223 states and 10066 transitions. [2019-09-08 08:27:35,573 INFO L78 Accepts]: Start accepts. Automaton has 6223 states and 10066 transitions. Word has length 261 [2019-09-08 08:27:35,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:27:35,574 INFO L475 AbstractCegarLoop]: Abstraction has 6223 states and 10066 transitions. [2019-09-08 08:27:35,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:27:35,574 INFO L276 IsEmpty]: Start isEmpty. Operand 6223 states and 10066 transitions. [2019-09-08 08:27:35,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-09-08 08:27:35,585 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:27:35,585 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:27:35,586 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:27:35,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:27:35,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1975836145, now seen corresponding path program 1 times [2019-09-08 08:27:35,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:27:35,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:27:35,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:27:35,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:27:35,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:27:35,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:27:36,159 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 08:27:36,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:27:36,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 08:27:36,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 08:27:36,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 08:27:36,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-09-08 08:27:36,160 INFO L87 Difference]: Start difference. First operand 6223 states and 10066 transitions. Second operand 13 states. [2019-09-08 08:27:50,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:27:50,862 INFO L93 Difference]: Finished difference Result 46976 states and 76609 transitions. [2019-09-08 08:27:50,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-08 08:27:50,863 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 265 [2019-09-08 08:27:50,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:27:51,084 INFO L225 Difference]: With dead ends: 46976 [2019-09-08 08:27:51,084 INFO L226 Difference]: Without dead ends: 41310 [2019-09-08 08:27:51,117 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 749 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=605, Invalid=2047, Unknown=0, NotChecked=0, Total=2652 [2019-09-08 08:27:51,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41310 states. [2019-09-08 08:27:52,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41310 to 37694. [2019-09-08 08:27:52,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37694 states. [2019-09-08 08:27:52,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37694 states to 37694 states and 61388 transitions. [2019-09-08 08:27:52,399 INFO L78 Accepts]: Start accepts. Automaton has 37694 states and 61388 transitions. Word has length 265 [2019-09-08 08:27:52,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:27:52,399 INFO L475 AbstractCegarLoop]: Abstraction has 37694 states and 61388 transitions. [2019-09-08 08:27:52,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 08:27:52,400 INFO L276 IsEmpty]: Start isEmpty. Operand 37694 states and 61388 transitions. [2019-09-08 08:27:52,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-09-08 08:27:52,424 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:27:52,425 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:27:52,425 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:27:52,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:27:52,426 INFO L82 PathProgramCache]: Analyzing trace with hash 107488039, now seen corresponding path program 1 times [2019-09-08 08:27:52,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:27:52,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:27:52,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:27:52,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:27:52,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:27:52,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:27:52,792 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 08:27:52,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:27:52,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:27:52,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:27:52,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:27:52,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:27:52,795 INFO L87 Difference]: Start difference. First operand 37694 states and 61388 transitions. Second operand 6 states. [2019-09-08 08:27:59,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:27:59,060 INFO L93 Difference]: Finished difference Result 96032 states and 156595 transitions. [2019-09-08 08:27:59,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 08:27:59,061 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 266 [2019-09-08 08:27:59,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:27:59,686 INFO L225 Difference]: With dead ends: 96032 [2019-09-08 08:27:59,686 INFO L226 Difference]: Without dead ends: 58895 [2019-09-08 08:27:59,817 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-08 08:27:59,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58895 states. [2019-09-08 08:28:01,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58895 to 55723. [2019-09-08 08:28:01,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55723 states. [2019-09-08 08:28:02,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55723 states to 55723 states and 90843 transitions. [2019-09-08 08:28:02,055 INFO L78 Accepts]: Start accepts. Automaton has 55723 states and 90843 transitions. Word has length 266 [2019-09-08 08:28:02,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:28:02,056 INFO L475 AbstractCegarLoop]: Abstraction has 55723 states and 90843 transitions. [2019-09-08 08:28:02,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:28:02,057 INFO L276 IsEmpty]: Start isEmpty. Operand 55723 states and 90843 transitions. [2019-09-08 08:28:02,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-09-08 08:28:02,093 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:28:02,093 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:28:02,094 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:28:02,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:28:02,094 INFO L82 PathProgramCache]: Analyzing trace with hash 2134593449, now seen corresponding path program 1 times [2019-09-08 08:28:02,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:28:02,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:28:02,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:28:02,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:28:02,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:28:02,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:28:03,658 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 08:28:03,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:28:03,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 08:28:03,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 08:28:03,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 08:28:03,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-09-08 08:28:03,660 INFO L87 Difference]: Start difference. First operand 55723 states and 90843 transitions. Second operand 13 states. [2019-09-08 08:28:19,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:28:19,748 INFO L93 Difference]: Finished difference Result 104122 states and 169778 transitions. [2019-09-08 08:28:19,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-08 08:28:19,749 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 267 [2019-09-08 08:28:19,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:28:20,379 INFO L225 Difference]: With dead ends: 104122 [2019-09-08 08:28:20,379 INFO L226 Difference]: Without dead ends: 101144 [2019-09-08 08:28:20,423 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1708 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=985, Invalid=3985, Unknown=0, NotChecked=0, Total=4970 [2019-09-08 08:28:20,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101144 states. [2019-09-08 08:28:24,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101144 to 91861. [2019-09-08 08:28:24,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91861 states. [2019-09-08 08:28:25,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91861 states to 91861 states and 149838 transitions. [2019-09-08 08:28:25,061 INFO L78 Accepts]: Start accepts. Automaton has 91861 states and 149838 transitions. Word has length 267 [2019-09-08 08:28:25,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:28:25,062 INFO L475 AbstractCegarLoop]: Abstraction has 91861 states and 149838 transitions. [2019-09-08 08:28:25,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 08:28:25,062 INFO L276 IsEmpty]: Start isEmpty. Operand 91861 states and 149838 transitions. [2019-09-08 08:28:25,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-09-08 08:28:25,096 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:28:25,097 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:28:25,097 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:28:25,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:28:25,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1425353305, now seen corresponding path program 1 times [2019-09-08 08:28:25,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:28:25,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:28:25,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:28:25,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:28:25,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:28:25,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:28:25,464 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 08:28:25,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:28:25,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 08:28:25,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 08:28:25,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 08:28:25,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-09-08 08:28:25,467 INFO L87 Difference]: Start difference. First operand 91861 states and 149838 transitions. Second operand 13 states. [2019-09-08 08:28:47,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:28:47,067 INFO L93 Difference]: Finished difference Result 148692 states and 242938 transitions. [2019-09-08 08:28:47,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-08 08:28:47,068 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 267 [2019-09-08 08:28:47,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:28:47,497 INFO L225 Difference]: With dead ends: 148692 [2019-09-08 08:28:47,497 INFO L226 Difference]: Without dead ends: 136982 [2019-09-08 08:28:47,557 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1913 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1055, Invalid=4495, Unknown=0, NotChecked=0, Total=5550 [2019-09-08 08:28:47,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136982 states. [2019-09-08 08:28:52,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136982 to 115067. [2019-09-08 08:28:52,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115067 states. [2019-09-08 08:28:53,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115067 states to 115067 states and 187689 transitions. [2019-09-08 08:28:53,051 INFO L78 Accepts]: Start accepts. Automaton has 115067 states and 187689 transitions. Word has length 267 [2019-09-08 08:28:53,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:28:53,051 INFO L475 AbstractCegarLoop]: Abstraction has 115067 states and 187689 transitions. [2019-09-08 08:28:53,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 08:28:53,052 INFO L276 IsEmpty]: Start isEmpty. Operand 115067 states and 187689 transitions. [2019-09-08 08:28:53,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-09-08 08:28:53,082 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:28:53,082 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:28:53,082 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:28:53,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:28:53,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1805107113, now seen corresponding path program 1 times [2019-09-08 08:28:53,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:28:53,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:28:53,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:28:53,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:28:53,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:28:53,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:28:53,456 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 08:28:53,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:28:53,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 08:28:53,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 08:28:53,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 08:28:53,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-09-08 08:28:53,458 INFO L87 Difference]: Start difference. First operand 115067 states and 187689 transitions. Second operand 13 states. [2019-09-08 08:29:12,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:29:12,763 INFO L93 Difference]: Finished difference Result 179723 states and 293691 transitions. [2019-09-08 08:29:12,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-08 08:29:12,763 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 267 [2019-09-08 08:29:12,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:29:13,305 INFO L225 Difference]: With dead ends: 179723 [2019-09-08 08:29:13,305 INFO L226 Difference]: Without dead ends: 149907 [2019-09-08 08:29:13,397 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1797 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1002, Invalid=4254, Unknown=0, NotChecked=0, Total=5256 [2019-09-08 08:29:13,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149907 states. [2019-09-08 08:29:16,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149907 to 130415. [2019-09-08 08:29:16,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130415 states. [2019-09-08 08:29:16,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130415 states to 130415 states and 212952 transitions. [2019-09-08 08:29:16,499 INFO L78 Accepts]: Start accepts. Automaton has 130415 states and 212952 transitions. Word has length 267 [2019-09-08 08:29:16,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:29:16,500 INFO L475 AbstractCegarLoop]: Abstraction has 130415 states and 212952 transitions. [2019-09-08 08:29:16,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 08:29:16,501 INFO L276 IsEmpty]: Start isEmpty. Operand 130415 states and 212952 transitions. [2019-09-08 08:29:16,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-09-08 08:29:16,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:29:16,529 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:29:16,530 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:29:16,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:29:16,530 INFO L82 PathProgramCache]: Analyzing trace with hash 523288921, now seen corresponding path program 1 times [2019-09-08 08:29:16,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:29:16,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:29:16,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:29:16,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:29:16,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:29:16,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:29:16,944 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 08:29:16,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:29:16,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 08:29:16,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 08:29:16,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 08:29:16,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-09-08 08:29:16,947 INFO L87 Difference]: Start difference. First operand 130415 states and 212952 transitions. Second operand 13 states. [2019-09-08 08:29:40,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:29:40,054 INFO L93 Difference]: Finished difference Result 239106 states and 391371 transitions. [2019-09-08 08:29:40,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-08 08:29:40,055 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 267 [2019-09-08 08:29:40,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:29:40,530 INFO L225 Difference]: With dead ends: 239106 [2019-09-08 08:29:40,530 INFO L226 Difference]: Without dead ends: 190508 [2019-09-08 08:29:40,610 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1800 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1002, Invalid=4254, Unknown=0, NotChecked=0, Total=5256 [2019-09-08 08:29:40,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190508 states. [2019-09-08 08:29:43,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190508 to 166156. [2019-09-08 08:29:43,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166156 states. [2019-09-08 08:29:43,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166156 states to 166156 states and 271912 transitions. [2019-09-08 08:29:43,948 INFO L78 Accepts]: Start accepts. Automaton has 166156 states and 271912 transitions. Word has length 267 [2019-09-08 08:29:43,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:29:43,949 INFO L475 AbstractCegarLoop]: Abstraction has 166156 states and 271912 transitions. [2019-09-08 08:29:43,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 08:29:43,949 INFO L276 IsEmpty]: Start isEmpty. Operand 166156 states and 271912 transitions. [2019-09-08 08:29:43,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-09-08 08:29:43,972 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:29:43,973 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:29:43,973 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:29:43,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:29:43,974 INFO L82 PathProgramCache]: Analyzing trace with hash -558026135, now seen corresponding path program 1 times [2019-09-08 08:29:43,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:29:43,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:29:43,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:29:43,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:29:43,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:29:44,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:29:44,388 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 08:29:44,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:29:44,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 08:29:44,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 08:29:44,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 08:29:44,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-09-08 08:29:44,390 INFO L87 Difference]: Start difference. First operand 166156 states and 271912 transitions. Second operand 13 states. [2019-09-08 08:30:07,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:30:07,024 INFO L93 Difference]: Finished difference Result 343052 states and 562492 transitions. [2019-09-08 08:30:07,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-08 08:30:07,025 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 267 [2019-09-08 08:30:07,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:30:07,745 INFO L225 Difference]: With dead ends: 343052 [2019-09-08 08:30:07,745 INFO L226 Difference]: Without dead ends: 261256 [2019-09-08 08:30:07,869 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1858 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1027, Invalid=4375, Unknown=0, NotChecked=0, Total=5402 [2019-09-08 08:30:08,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261256 states. [2019-09-08 08:30:15,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261256 to 207357. [2019-09-08 08:30:15,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207357 states. [2019-09-08 08:30:16,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207357 states to 207357 states and 340554 transitions. [2019-09-08 08:30:16,118 INFO L78 Accepts]: Start accepts. Automaton has 207357 states and 340554 transitions. Word has length 267 [2019-09-08 08:30:16,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:30:16,118 INFO L475 AbstractCegarLoop]: Abstraction has 207357 states and 340554 transitions. [2019-09-08 08:30:16,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 08:30:16,118 INFO L276 IsEmpty]: Start isEmpty. Operand 207357 states and 340554 transitions. [2019-09-08 08:30:16,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-09-08 08:30:16,135 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:30:16,135 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:30:16,136 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:30:16,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:30:16,136 INFO L82 PathProgramCache]: Analyzing trace with hash -2028413336, now seen corresponding path program 1 times [2019-09-08 08:30:16,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:30:16,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:30:16,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:30:16,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:30:16,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:30:16,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:30:16,356 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 08:30:16,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:30:16,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:30:16,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:30:16,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:30:16,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:30:16,357 INFO L87 Difference]: Start difference. First operand 207357 states and 340554 transitions. Second operand 6 states. [2019-09-08 08:30:25,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:30:25,013 INFO L93 Difference]: Finished difference Result 473772 states and 777278 transitions. [2019-09-08 08:30:25,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 08:30:25,013 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 267 [2019-09-08 08:30:25,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:30:25,666 INFO L225 Difference]: With dead ends: 473772 [2019-09-08 08:30:25,667 INFO L226 Difference]: Without dead ends: 266972 [2019-09-08 08:30:25,858 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 08:30:26,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266972 states. [2019-09-08 08:30:36,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266972 to 265014. [2019-09-08 08:30:36,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265014 states. [2019-09-08 08:30:37,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265014 states to 265014 states and 434801 transitions. [2019-09-08 08:30:37,046 INFO L78 Accepts]: Start accepts. Automaton has 265014 states and 434801 transitions. Word has length 267 [2019-09-08 08:30:37,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:30:37,046 INFO L475 AbstractCegarLoop]: Abstraction has 265014 states and 434801 transitions. [2019-09-08 08:30:37,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:30:37,046 INFO L276 IsEmpty]: Start isEmpty. Operand 265014 states and 434801 transitions. [2019-09-08 08:30:37,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-09-08 08:30:37,065 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:30:37,066 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:30:37,066 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:30:37,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:30:37,066 INFO L82 PathProgramCache]: Analyzing trace with hash 733997167, now seen corresponding path program 1 times [2019-09-08 08:30:37,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:30:37,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:30:37,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:30:37,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:30:37,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:30:37,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:30:37,465 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 08:30:37,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:30:37,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 08:30:37,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 08:30:37,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 08:30:37,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-09-08 08:30:37,467 INFO L87 Difference]: Start difference. First operand 265014 states and 434801 transitions. Second operand 14 states. [2019-09-08 08:31:06,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:31:06,317 INFO L93 Difference]: Finished difference Result 625090 states and 1041598 transitions. [2019-09-08 08:31:06,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-09-08 08:31:06,318 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 268 [2019-09-08 08:31:06,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:31:07,854 INFO L225 Difference]: With dead ends: 625090 [2019-09-08 08:31:07,854 INFO L226 Difference]: Without dead ends: 538859 [2019-09-08 08:31:08,093 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2394 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1287, Invalid=5355, Unknown=0, NotChecked=0, Total=6642 [2019-09-08 08:31:08,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538859 states. [2019-09-08 08:31:33,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538859 to 483687. [2019-09-08 08:31:33,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483687 states. [2019-09-08 08:31:34,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483687 states to 483687 states and 797368 transitions. [2019-09-08 08:31:34,896 INFO L78 Accepts]: Start accepts. Automaton has 483687 states and 797368 transitions. Word has length 268 [2019-09-08 08:31:34,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:31:34,896 INFO L475 AbstractCegarLoop]: Abstraction has 483687 states and 797368 transitions. [2019-09-08 08:31:34,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 08:31:34,896 INFO L276 IsEmpty]: Start isEmpty. Operand 483687 states and 797368 transitions. [2019-09-08 08:31:34,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-09-08 08:31:34,919 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:31:34,922 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:31:34,922 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:31:34,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:31:34,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1599395471, now seen corresponding path program 1 times [2019-09-08 08:31:34,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:31:34,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:31:34,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:31:34,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:31:34,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:31:35,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:31:35,149 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 08:31:35,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:31:35,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 08:31:35,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 08:31:35,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 08:31:35,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:31:35,153 INFO L87 Difference]: Start difference. First operand 483687 states and 797368 transitions. Second operand 7 states. [2019-09-08 08:31:59,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:31:59,738 INFO L93 Difference]: Finished difference Result 959314 states and 1586094 transitions. [2019-09-08 08:31:59,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 08:31:59,738 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 268 [2019-09-08 08:31:59,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:32:01,243 INFO L225 Difference]: With dead ends: 959314 [2019-09-08 08:32:01,243 INFO L226 Difference]: Without dead ends: 630864 [2019-09-08 08:32:01,561 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 08:32:02,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630864 states. [2019-09-08 08:32:26,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630864 to 630092. [2019-09-08 08:32:26,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630092 states. [2019-09-08 08:32:39,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630092 states to 630092 states and 1039977 transitions. [2019-09-08 08:32:39,061 INFO L78 Accepts]: Start accepts. Automaton has 630092 states and 1039977 transitions. Word has length 268 [2019-09-08 08:32:39,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:32:39,062 INFO L475 AbstractCegarLoop]: Abstraction has 630092 states and 1039977 transitions. [2019-09-08 08:32:39,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 08:32:39,062 INFO L276 IsEmpty]: Start isEmpty. Operand 630092 states and 1039977 transitions. [2019-09-08 08:32:39,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-09-08 08:32:39,086 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:32:39,086 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:32:39,086 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:32:39,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:32:39,087 INFO L82 PathProgramCache]: Analyzing trace with hash 426435838, now seen corresponding path program 1 times [2019-09-08 08:32:39,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:32:39,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:32:39,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:32:39,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:32:39,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:32:39,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:32:39,306 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 08:32:39,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:32:39,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:32:39,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:32:39,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:32:39,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:32:39,309 INFO L87 Difference]: Start difference. First operand 630092 states and 1039977 transitions. Second operand 6 states. [2019-09-08 08:33:17,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:33:17,016 INFO L93 Difference]: Finished difference Result 1873862 states and 3094592 transitions. [2019-09-08 08:33:17,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 08:33:17,016 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 268 [2019-09-08 08:33:17,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:33:21,950 INFO L225 Difference]: With dead ends: 1873862 [2019-09-08 08:33:21,950 INFO L226 Difference]: Without dead ends: 1246819 [2019-09-08 08:33:22,699 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-08 08:33:36,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246819 states. [2019-09-08 08:34:41,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246819 to 1241064. [2019-09-08 08:34:41,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1241064 states. [2019-09-08 08:34:45,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241064 states to 1241064 states and 2044928 transitions. [2019-09-08 08:34:45,790 INFO L78 Accepts]: Start accepts. Automaton has 1241064 states and 2044928 transitions. Word has length 268 [2019-09-08 08:34:45,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:34:45,791 INFO L475 AbstractCegarLoop]: Abstraction has 1241064 states and 2044928 transitions. [2019-09-08 08:34:45,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:34:45,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1241064 states and 2044928 transitions. [2019-09-08 08:34:45,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-09-08 08:34:45,825 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:34:45,826 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:34:45,826 INFO L418 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:34:45,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:34:45,826 INFO L82 PathProgramCache]: Analyzing trace with hash -627700207, now seen corresponding path program 1 times [2019-09-08 08:34:45,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:34:45,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:34:45,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:34:45,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:34:45,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:34:45,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:34:46,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:34:46,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:34:46,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:34:46,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:34:46,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:34:46,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:34:46,095 INFO L87 Difference]: Start difference. First operand 1241064 states and 2044928 transitions. Second operand 6 states.