java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 13:17:10,327 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 13:17:10,329 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 13:17:10,341 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 13:17:10,342 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 13:17:10,343 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 13:17:10,344 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 13:17:10,346 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 13:17:10,348 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 13:17:10,348 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 13:17:10,349 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 13:17:10,351 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 13:17:10,351 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 13:17:10,352 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 13:17:10,353 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 13:17:10,354 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 13:17:10,355 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 13:17:10,356 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 13:17:10,357 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 13:17:10,359 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 13:17:10,361 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 13:17:10,362 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 13:17:10,363 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 13:17:10,364 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 13:17:10,366 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 13:17:10,366 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 13:17:10,367 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 13:17:10,367 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 13:17:10,368 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 13:17:10,369 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 13:17:10,369 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 13:17:10,370 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 13:17:10,371 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 13:17:10,372 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 13:17:10,373 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 13:17:10,373 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 13:17:10,374 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 13:17:10,374 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 13:17:10,374 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 13:17:10,375 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 13:17:10,375 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 13:17:10,376 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 13:17:10,391 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 13:17:10,392 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 13:17:10,393 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 13:17:10,393 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 13:17:10,393 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 13:17:10,394 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 13:17:10,394 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 13:17:10,394 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 13:17:10,394 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 13:17:10,394 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 13:17:10,394 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 13:17:10,395 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 13:17:10,395 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 13:17:10,395 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 13:17:10,395 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 13:17:10,395 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 13:17:10,396 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 13:17:10,396 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 13:17:10,396 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 13:17:10,396 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 13:17:10,396 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 13:17:10,397 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:17:10,397 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 13:17:10,397 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 13:17:10,397 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 13:17:10,397 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 13:17:10,398 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 13:17:10,398 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 13:17:10,398 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 13:17:10,427 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 13:17:10,441 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 13:17:10,444 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 13:17:10,446 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 13:17:10,446 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 13:17:10,447 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 13:17:10,527 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32f894da7/23844a9f496f4a648ade686e9bbd2a81/FLAG090ddfda4 [2019-09-08 13:17:11,103 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 13:17:11,104 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 13:17:11,132 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32f894da7/23844a9f496f4a648ade686e9bbd2a81/FLAG090ddfda4 [2019-09-08 13:17:11,381 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32f894da7/23844a9f496f4a648ade686e9bbd2a81 [2019-09-08 13:17:11,393 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 13:17:11,395 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 13:17:11,397 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 13:17:11,397 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 13:17:11,401 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 13:17:11,401 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:17:11" (1/1) ... [2019-09-08 13:17:11,404 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20f32f16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:17:11, skipping insertion in model container [2019-09-08 13:17:11,404 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:17:11" (1/1) ... [2019-09-08 13:17:11,411 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 13:17:11,496 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 13:17:12,341 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:17:12,371 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 13:17:12,699 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:17:12,729 INFO L192 MainTranslator]: Completed translation [2019-09-08 13:17:12,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:17:12 WrapperNode [2019-09-08 13:17:12,730 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 13:17:12,731 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 13:17:12,731 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 13:17:12,731 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 13:17:12,752 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:17:12" (1/1) ... [2019-09-08 13:17:12,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:17:12" (1/1) ... [2019-09-08 13:17:12,805 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:17:12" (1/1) ... [2019-09-08 13:17:12,808 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:17:12" (1/1) ... [2019-09-08 13:17:12,873 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:17:12" (1/1) ... [2019-09-08 13:17:12,905 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:17:12" (1/1) ... [2019-09-08 13:17:12,919 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:17:12" (1/1) ... [2019-09-08 13:17:12,941 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 13:17:12,942 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 13:17:12,943 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 13:17:12,943 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 13:17:12,944 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:17:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:17:13,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 13:17:13,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 13:17:13,011 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 13:17:13,011 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 13:17:13,011 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 13:17:13,012 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 13:17:13,012 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 13:17:13,012 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 13:17:13,012 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 13:17:13,012 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 13:17:13,013 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 13:17:13,013 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 13:17:13,013 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 13:17:13,013 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 13:17:13,013 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 13:17:13,014 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 13:17:13,014 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 13:17:13,014 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 13:17:13,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 13:17:13,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 13:17:15,375 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 13:17:15,375 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 13:17:15,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:17:15 BoogieIcfgContainer [2019-09-08 13:17:15,377 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 13:17:15,379 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 13:17:15,379 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 13:17:15,382 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 13:17:15,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:17:11" (1/3) ... [2019-09-08 13:17:15,383 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@353303bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:17:15, skipping insertion in model container [2019-09-08 13:17:15,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:17:12" (2/3) ... [2019-09-08 13:17:15,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@353303bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:17:15, skipping insertion in model container [2019-09-08 13:17:15,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:17:15" (3/3) ... [2019-09-08 13:17:15,386 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 13:17:15,396 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 13:17:15,405 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 13:17:15,425 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 13:17:15,465 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 13:17:15,465 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 13:17:15,466 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 13:17:15,466 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 13:17:15,466 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 13:17:15,466 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 13:17:15,466 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 13:17:15,466 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 13:17:15,467 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 13:17:15,496 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states. [2019-09-08 13:17:15,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-09-08 13:17:15,517 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:17:15,518 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:17:15,520 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:17:15,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:17:15,526 INFO L82 PathProgramCache]: Analyzing trace with hash -625555481, now seen corresponding path program 1 times [2019-09-08 13:17:15,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:17:15,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:17:15,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:17:15,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:17:15,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:17:15,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:17:16,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:17:16,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:17:16,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:17:16,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:17:16,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:17:16,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:17:16,338 INFO L87 Difference]: Start difference. First operand 652 states. Second operand 3 states. [2019-09-08 13:17:16,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:17:16,681 INFO L93 Difference]: Finished difference Result 1207 states and 2116 transitions. [2019-09-08 13:17:16,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:17:16,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 254 [2019-09-08 13:17:16,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:17:16,720 INFO L225 Difference]: With dead ends: 1207 [2019-09-08 13:17:16,720 INFO L226 Difference]: Without dead ends: 999 [2019-09-08 13:17:16,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:17:16,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2019-09-08 13:17:16,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 997. [2019-09-08 13:17:16,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-09-08 13:17:16,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1568 transitions. [2019-09-08 13:17:16,867 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1568 transitions. Word has length 254 [2019-09-08 13:17:16,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:17:16,869 INFO L475 AbstractCegarLoop]: Abstraction has 997 states and 1568 transitions. [2019-09-08 13:17:16,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:17:16,869 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1568 transitions. [2019-09-08 13:17:16,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-09-08 13:17:16,876 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:17:16,876 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:17:16,877 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:17:16,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:17:16,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1696085954, now seen corresponding path program 1 times [2019-09-08 13:17:16,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:17:16,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:17:16,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:17:16,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:17:16,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:17:17,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:17:17,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:17:17,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:17:17,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:17:17,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:17:17,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:17:17,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:17:17,752 INFO L87 Difference]: Start difference. First operand 997 states and 1568 transitions. Second operand 4 states. [2019-09-08 13:17:17,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:17:17,989 INFO L93 Difference]: Finished difference Result 2932 states and 4609 transitions. [2019-09-08 13:17:17,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:17:17,990 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 254 [2019-09-08 13:17:17,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:17:18,003 INFO L225 Difference]: With dead ends: 2932 [2019-09-08 13:17:18,003 INFO L226 Difference]: Without dead ends: 1950 [2019-09-08 13:17:18,009 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:17:18,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950 states. [2019-09-08 13:17:18,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 1948. [2019-09-08 13:17:18,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1948 states. [2019-09-08 13:17:18,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1948 states to 1948 states and 3046 transitions. [2019-09-08 13:17:18,147 INFO L78 Accepts]: Start accepts. Automaton has 1948 states and 3046 transitions. Word has length 254 [2019-09-08 13:17:18,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:17:18,149 INFO L475 AbstractCegarLoop]: Abstraction has 1948 states and 3046 transitions. [2019-09-08 13:17:18,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:17:18,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1948 states and 3046 transitions. [2019-09-08 13:17:18,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-08 13:17:18,225 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:17:18,225 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:17:18,225 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:17:18,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:17:18,226 INFO L82 PathProgramCache]: Analyzing trace with hash 721618672, now seen corresponding path program 1 times [2019-09-08 13:17:18,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:17:18,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:17:18,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:17:18,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:17:18,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:17:18,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:17:18,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:17:18,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:17:18,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:17:18,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:17:18,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:17:18,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:17:18,469 INFO L87 Difference]: Start difference. First operand 1948 states and 3046 transitions. Second operand 3 states. [2019-09-08 13:17:18,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:17:18,696 INFO L93 Difference]: Finished difference Result 5639 states and 8786 transitions. [2019-09-08 13:17:18,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:17:18,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 256 [2019-09-08 13:17:18,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:17:18,723 INFO L225 Difference]: With dead ends: 5639 [2019-09-08 13:17:18,724 INFO L226 Difference]: Without dead ends: 3820 [2019-09-08 13:17:18,737 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:17:18,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3820 states. [2019-09-08 13:17:18,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3820 to 3818. [2019-09-08 13:17:18,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3818 states. [2019-09-08 13:17:18,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3818 states to 3818 states and 5939 transitions. [2019-09-08 13:17:18,956 INFO L78 Accepts]: Start accepts. Automaton has 3818 states and 5939 transitions. Word has length 256 [2019-09-08 13:17:18,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:17:18,957 INFO L475 AbstractCegarLoop]: Abstraction has 3818 states and 5939 transitions. [2019-09-08 13:17:18,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:17:18,957 INFO L276 IsEmpty]: Start isEmpty. Operand 3818 states and 5939 transitions. [2019-09-08 13:17:18,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-08 13:17:18,969 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:17:18,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] [2019-09-08 13:17:18,970 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:17:18,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:17:18,970 INFO L82 PathProgramCache]: Analyzing trace with hash -2042478027, now seen corresponding path program 1 times [2019-09-08 13:17:18,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:17:18,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:17:18,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:17:18,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:17:18,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:17:19,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:17:19,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:17:19,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:17:19,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:17:19,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:17:19,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:17:19,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:17:19,167 INFO L87 Difference]: Start difference. First operand 3818 states and 5939 transitions. Second operand 3 states. [2019-09-08 13:17:19,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:17:19,480 INFO L93 Difference]: Finished difference Result 11379 states and 17693 transitions. [2019-09-08 13:17:19,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:17:19,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 256 [2019-09-08 13:17:19,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:17:19,519 INFO L225 Difference]: With dead ends: 11379 [2019-09-08 13:17:19,520 INFO L226 Difference]: Without dead ends: 7603 [2019-09-08 13:17:19,531 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:17:19,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7603 states. [2019-09-08 13:17:19,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7603 to 3837. [2019-09-08 13:17:19,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3837 states. [2019-09-08 13:17:19,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3837 states to 3837 states and 5967 transitions. [2019-09-08 13:17:19,789 INFO L78 Accepts]: Start accepts. Automaton has 3837 states and 5967 transitions. Word has length 256 [2019-09-08 13:17:19,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:17:19,789 INFO L475 AbstractCegarLoop]: Abstraction has 3837 states and 5967 transitions. [2019-09-08 13:17:19,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:17:19,789 INFO L276 IsEmpty]: Start isEmpty. Operand 3837 states and 5967 transitions. [2019-09-08 13:17:19,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-08 13:17:19,798 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:17:19,798 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:17:19,798 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:17:19,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:17:19,799 INFO L82 PathProgramCache]: Analyzing trace with hash 911178296, now seen corresponding path program 1 times [2019-09-08 13:17:19,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:17:19,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:17:19,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:17:19,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:17:19,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:17:19,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:17:20,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:17:20,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:17:20,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:17:20,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:17:20,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:17:20,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:17:20,020 INFO L87 Difference]: Start difference. First operand 3837 states and 5967 transitions. Second operand 3 states. [2019-09-08 13:17:20,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:17:20,488 INFO L93 Difference]: Finished difference Result 11398 states and 17714 transitions. [2019-09-08 13:17:20,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:17:20,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 257 [2019-09-08 13:17:20,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:17:20,542 INFO L225 Difference]: With dead ends: 11398 [2019-09-08 13:17:20,542 INFO L226 Difference]: Without dead ends: 7621 [2019-09-08 13:17:20,558 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:17:20,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7621 states. [2019-09-08 13:17:20,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7621 to 3855. [2019-09-08 13:17:20,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3855 states. [2019-09-08 13:17:20,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3855 states to 3855 states and 5988 transitions. [2019-09-08 13:17:20,924 INFO L78 Accepts]: Start accepts. Automaton has 3855 states and 5988 transitions. Word has length 257 [2019-09-08 13:17:20,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:17:20,925 INFO L475 AbstractCegarLoop]: Abstraction has 3855 states and 5988 transitions. [2019-09-08 13:17:20,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:17:20,925 INFO L276 IsEmpty]: Start isEmpty. Operand 3855 states and 5988 transitions. [2019-09-08 13:17:20,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-08 13:17:20,937 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:17:20,938 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] [2019-09-08 13:17:20,938 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:17:20,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:17:20,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1063620725, now seen corresponding path program 1 times [2019-09-08 13:17:20,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:17:20,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:17:20,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:17:20,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:17:20,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:17:21,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:17:21,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:17:21,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:17:21,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:17:21,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:17:21,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:17:21,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:17:21,257 INFO L87 Difference]: Start difference. First operand 3855 states and 5988 transitions. Second operand 3 states. [2019-09-08 13:17:21,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:17:21,803 INFO L93 Difference]: Finished difference Result 11078 states and 17141 transitions. [2019-09-08 13:17:21,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:17:21,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 258 [2019-09-08 13:17:21,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:17:21,852 INFO L225 Difference]: With dead ends: 11078 [2019-09-08 13:17:21,852 INFO L226 Difference]: Without dead ends: 7468 [2019-09-08 13:17:21,862 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:17:21,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7468 states. [2019-09-08 13:17:22,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7468 to 7466. [2019-09-08 13:17:22,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7466 states. [2019-09-08 13:17:22,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7466 states to 7466 states and 11516 transitions. [2019-09-08 13:17:22,293 INFO L78 Accepts]: Start accepts. Automaton has 7466 states and 11516 transitions. Word has length 258 [2019-09-08 13:17:22,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:17:22,294 INFO L475 AbstractCegarLoop]: Abstraction has 7466 states and 11516 transitions. [2019-09-08 13:17:22,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:17:22,294 INFO L276 IsEmpty]: Start isEmpty. Operand 7466 states and 11516 transitions. [2019-09-08 13:17:22,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-08 13:17:22,308 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:17:22,309 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] [2019-09-08 13:17:22,309 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:17:22,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:17:22,314 INFO L82 PathProgramCache]: Analyzing trace with hash 33763368, now seen corresponding path program 1 times [2019-09-08 13:17:22,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:17:22,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:17:22,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:17:22,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:17:22,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:17:22,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:17:22,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:17:22,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:17:22,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:17:22,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:17:22,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:17:22,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:17:22,605 INFO L87 Difference]: Start difference. First operand 7466 states and 11516 transitions. Second operand 4 states. [2019-09-08 13:17:23,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:17:23,446 INFO L93 Difference]: Finished difference Result 20664 states and 31701 transitions. [2019-09-08 13:17:23,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:17:23,447 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 258 [2019-09-08 13:17:23,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:17:23,480 INFO L225 Difference]: With dead ends: 20664 [2019-09-08 13:17:23,480 INFO L226 Difference]: Without dead ends: 13738 [2019-09-08 13:17:23,499 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:17:23,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13738 states. [2019-09-08 13:17:24,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13738 to 7701. [2019-09-08 13:17:24,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7701 states. [2019-09-08 13:17:24,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7701 states to 7701 states and 11904 transitions. [2019-09-08 13:17:24,030 INFO L78 Accepts]: Start accepts. Automaton has 7701 states and 11904 transitions. Word has length 258 [2019-09-08 13:17:24,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:17:24,031 INFO L475 AbstractCegarLoop]: Abstraction has 7701 states and 11904 transitions. [2019-09-08 13:17:24,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:17:24,031 INFO L276 IsEmpty]: Start isEmpty. Operand 7701 states and 11904 transitions. [2019-09-08 13:17:24,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-08 13:17:24,101 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:17:24,101 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] [2019-09-08 13:17:24,101 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:17:24,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:17:24,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1740963393, now seen corresponding path program 1 times [2019-09-08 13:17:24,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:17:24,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:17:24,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:17:24,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:17:24,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:17:24,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:17:24,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:17:24,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:17:24,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:17:24,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:17:24,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:17:24,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:17:24,245 INFO L87 Difference]: Start difference. First operand 7701 states and 11904 transitions. Second operand 3 states. [2019-09-08 13:17:24,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:17:24,878 INFO L93 Difference]: Finished difference Result 17057 states and 26554 transitions. [2019-09-08 13:17:24,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:17:24,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 258 [2019-09-08 13:17:24,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:17:24,903 INFO L225 Difference]: With dead ends: 17057 [2019-09-08 13:17:24,903 INFO L226 Difference]: Without dead ends: 11111 [2019-09-08 13:17:24,919 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:17:24,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11111 states. [2019-09-08 13:17:26,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11111 to 9685. [2019-09-08 13:17:26,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9685 states. [2019-09-08 13:17:26,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9685 states to 9685 states and 15180 transitions. [2019-09-08 13:17:26,119 INFO L78 Accepts]: Start accepts. Automaton has 9685 states and 15180 transitions. Word has length 258 [2019-09-08 13:17:26,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:17:26,120 INFO L475 AbstractCegarLoop]: Abstraction has 9685 states and 15180 transitions. [2019-09-08 13:17:26,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:17:26,120 INFO L276 IsEmpty]: Start isEmpty. Operand 9685 states and 15180 transitions. [2019-09-08 13:17:26,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-09-08 13:17:26,135 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:17:26,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] [2019-09-08 13:17:26,135 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:17:26,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:17:26,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1667579256, now seen corresponding path program 1 times [2019-09-08 13:17:26,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:17:26,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:17:26,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:17:26,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:17:26,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:17:26,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:17:26,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:17:26,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:17:26,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:17:26,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:17:26,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:17:26,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:17:26,279 INFO L87 Difference]: Start difference. First operand 9685 states and 15180 transitions. Second operand 3 states. [2019-09-08 13:17:27,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:17:27,234 INFO L93 Difference]: Finished difference Result 22145 states and 35038 transitions. [2019-09-08 13:17:27,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:17:27,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 260 [2019-09-08 13:17:27,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:17:27,276 INFO L225 Difference]: With dead ends: 22145 [2019-09-08 13:17:27,277 INFO L226 Difference]: Without dead ends: 14527 [2019-09-08 13:17:27,302 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:17:27,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14527 states. [2019-09-08 13:17:28,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14527 to 13261. [2019-09-08 13:17:28,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13261 states. [2019-09-08 13:17:28,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13261 states to 13261 states and 21064 transitions. [2019-09-08 13:17:28,255 INFO L78 Accepts]: Start accepts. Automaton has 13261 states and 21064 transitions. Word has length 260 [2019-09-08 13:17:28,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:17:28,256 INFO L475 AbstractCegarLoop]: Abstraction has 13261 states and 21064 transitions. [2019-09-08 13:17:28,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:17:28,256 INFO L276 IsEmpty]: Start isEmpty. Operand 13261 states and 21064 transitions. [2019-09-08 13:17:28,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-09-08 13:17:28,270 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:17:28,270 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:17:28,271 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:17:28,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:17:28,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1902966007, now seen corresponding path program 1 times [2019-09-08 13:17:28,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:17:28,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:17:28,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:17:28,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:17:28,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:17:28,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:17:28,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:17:28,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:17:28,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:17:28,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:17:28,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:17:28,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:17:28,393 INFO L87 Difference]: Start difference. First operand 13261 states and 21064 transitions. Second operand 3 states. [2019-09-08 13:17:29,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:17:29,720 INFO L93 Difference]: Finished difference Result 38213 states and 60473 transitions. [2019-09-08 13:17:29,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:17:29,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 260 [2019-09-08 13:17:29,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:17:29,783 INFO L225 Difference]: With dead ends: 38213 [2019-09-08 13:17:29,783 INFO L226 Difference]: Without dead ends: 25755 [2019-09-08 13:17:29,812 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:17:29,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25755 states. [2019-09-08 13:17:30,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25755 to 13365. [2019-09-08 13:17:30,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13365 states. [2019-09-08 13:17:30,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13365 states to 13365 states and 21207 transitions. [2019-09-08 13:17:30,665 INFO L78 Accepts]: Start accepts. Automaton has 13365 states and 21207 transitions. Word has length 260 [2019-09-08 13:17:30,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:17:30,666 INFO L475 AbstractCegarLoop]: Abstraction has 13365 states and 21207 transitions. [2019-09-08 13:17:30,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:17:30,666 INFO L276 IsEmpty]: Start isEmpty. Operand 13365 states and 21207 transitions. [2019-09-08 13:17:30,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-08 13:17:30,681 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:17:30,681 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:17:30,681 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:17:30,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:17:30,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1132182754, now seen corresponding path program 1 times [2019-09-08 13:17:30,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:17:30,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:17:30,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:17:30,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:17:30,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:17:30,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:17:30,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:17:30,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:17:30,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:17:30,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:17:30,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:17:30,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:17:30,793 INFO L87 Difference]: Start difference. First operand 13365 states and 21207 transitions. Second operand 3 states. [2019-09-08 13:17:32,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:17:32,295 INFO L93 Difference]: Finished difference Result 38345 states and 60639 transitions. [2019-09-08 13:17:32,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:17:32,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2019-09-08 13:17:32,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:17:32,347 INFO L225 Difference]: With dead ends: 38345 [2019-09-08 13:17:32,347 INFO L226 Difference]: Without dead ends: 25880 [2019-09-08 13:17:32,382 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:17:32,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25880 states. [2019-09-08 13:17:33,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25880 to 13490. [2019-09-08 13:17:33,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13490 states. [2019-09-08 13:17:33,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13490 states to 13490 states and 21353 transitions. [2019-09-08 13:17:33,820 INFO L78 Accepts]: Start accepts. Automaton has 13490 states and 21353 transitions. Word has length 261 [2019-09-08 13:17:33,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:17:33,820 INFO L475 AbstractCegarLoop]: Abstraction has 13490 states and 21353 transitions. [2019-09-08 13:17:33,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:17:33,821 INFO L276 IsEmpty]: Start isEmpty. Operand 13490 states and 21353 transitions. [2019-09-08 13:17:33,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-08 13:17:33,835 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:17:33,835 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:17:33,836 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:17:33,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:17:33,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1032258475, now seen corresponding path program 1 times [2019-09-08 13:17:33,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:17:33,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:17:33,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:17:33,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:17:33,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:17:33,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:17:34,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:17:34,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:17:34,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 13:17:34,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 13:17:34,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 13:17:34,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:17:34,125 INFO L87 Difference]: Start difference. First operand 13490 states and 21353 transitions. Second operand 5 states. [2019-09-08 13:17:35,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:17:35,429 INFO L93 Difference]: Finished difference Result 25014 states and 39683 transitions. [2019-09-08 13:17:35,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 13:17:35,429 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 261 [2019-09-08 13:17:35,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:17:35,456 INFO L225 Difference]: With dead ends: 25014 [2019-09-08 13:17:35,457 INFO L226 Difference]: Without dead ends: 13492 [2019-09-08 13:17:35,478 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 13:17:35,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13492 states. [2019-09-08 13:17:36,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13492 to 13490. [2019-09-08 13:17:36,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13490 states. [2019-09-08 13:17:36,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13490 states to 13490 states and 21273 transitions. [2019-09-08 13:17:36,300 INFO L78 Accepts]: Start accepts. Automaton has 13490 states and 21273 transitions. Word has length 261 [2019-09-08 13:17:36,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:17:36,300 INFO L475 AbstractCegarLoop]: Abstraction has 13490 states and 21273 transitions. [2019-09-08 13:17:36,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 13:17:36,301 INFO L276 IsEmpty]: Start isEmpty. Operand 13490 states and 21273 transitions. [2019-09-08 13:17:36,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-08 13:17:36,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:17:36,315 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:17:36,315 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:17:36,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:17:36,316 INFO L82 PathProgramCache]: Analyzing trace with hash -2103562182, now seen corresponding path program 1 times [2019-09-08 13:17:36,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:17:36,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:17:36,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:17:36,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:17:36,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:17:36,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:17:36,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:17:36,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:17:36,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 13:17:36,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 13:17:36,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 13:17:36,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:17:36,669 INFO L87 Difference]: Start difference. First operand 13490 states and 21273 transitions. Second operand 9 states. [2019-09-08 13:17:39,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:17:39,754 INFO L93 Difference]: Finished difference Result 42704 states and 67920 transitions. [2019-09-08 13:17:39,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 13:17:39,754 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 261 [2019-09-08 13:17:39,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:17:39,808 INFO L225 Difference]: With dead ends: 42704 [2019-09-08 13:17:39,808 INFO L226 Difference]: Without dead ends: 31326 [2019-09-08 13:17:39,832 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-09-08 13:17:39,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31326 states. [2019-09-08 13:17:40,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31326 to 16942. [2019-09-08 13:17:40,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16942 states. [2019-09-08 13:17:40,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16942 states to 16942 states and 26257 transitions. [2019-09-08 13:17:40,970 INFO L78 Accepts]: Start accepts. Automaton has 16942 states and 26257 transitions. Word has length 261 [2019-09-08 13:17:40,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:17:40,970 INFO L475 AbstractCegarLoop]: Abstraction has 16942 states and 26257 transitions. [2019-09-08 13:17:40,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 13:17:40,970 INFO L276 IsEmpty]: Start isEmpty. Operand 16942 states and 26257 transitions. [2019-09-08 13:17:40,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-08 13:17:40,982 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:17:40,982 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:17:40,983 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:17:40,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:17:40,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1561382285, now seen corresponding path program 1 times [2019-09-08 13:17:40,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:17:40,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:17:40,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:17:40,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:17:40,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:17:41,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:17:41,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:17:41,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:17:41,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:17:41,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:17:41,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:17:41,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:17:41,429 INFO L87 Difference]: Start difference. First operand 16942 states and 26257 transitions. Second operand 4 states. [2019-09-08 13:17:44,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:17:44,062 INFO L93 Difference]: Finished difference Result 49803 states and 77205 transitions. [2019-09-08 13:17:44,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:17:44,063 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 261 [2019-09-08 13:17:44,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:17:44,117 INFO L225 Difference]: With dead ends: 49803 [2019-09-08 13:17:44,117 INFO L226 Difference]: Without dead ends: 32933 [2019-09-08 13:17:44,149 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:17:44,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32933 states. [2019-09-08 13:17:46,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32933 to 32931. [2019-09-08 13:17:46,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32931 states. [2019-09-08 13:17:46,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32931 states to 32931 states and 50828 transitions. [2019-09-08 13:17:46,057 INFO L78 Accepts]: Start accepts. Automaton has 32931 states and 50828 transitions. Word has length 261 [2019-09-08 13:17:46,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:17:46,057 INFO L475 AbstractCegarLoop]: Abstraction has 32931 states and 50828 transitions. [2019-09-08 13:17:46,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:17:46,057 INFO L276 IsEmpty]: Start isEmpty. Operand 32931 states and 50828 transitions. [2019-09-08 13:17:46,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-09-08 13:17:46,072 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:17:46,072 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:17:46,073 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:17:46,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:17:46,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1771744488, now seen corresponding path program 1 times [2019-09-08 13:17:46,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:17:46,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:17:46,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:17:46,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:17:46,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:17:46,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:17:46,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:17:46,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:17:46,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:17:46,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:17:46,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:17:46,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:17:46,253 INFO L87 Difference]: Start difference. First operand 32931 states and 50828 transitions. Second operand 3 states. [2019-09-08 13:17:49,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:17:49,764 INFO L93 Difference]: Finished difference Result 95469 states and 147144 transitions. [2019-09-08 13:17:49,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:17:49,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-09-08 13:17:49,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:17:49,840 INFO L225 Difference]: With dead ends: 95469 [2019-09-08 13:17:49,840 INFO L226 Difference]: Without dead ends: 64027 [2019-09-08 13:17:49,883 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:17:49,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64027 states. [2019-09-08 13:17:54,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64027 to 64025. [2019-09-08 13:17:54,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64025 states. [2019-09-08 13:17:54,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64025 states to 64025 states and 98383 transitions. [2019-09-08 13:17:54,725 INFO L78 Accepts]: Start accepts. Automaton has 64025 states and 98383 transitions. Word has length 263 [2019-09-08 13:17:54,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:17:54,726 INFO L475 AbstractCegarLoop]: Abstraction has 64025 states and 98383 transitions. [2019-09-08 13:17:54,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:17:54,726 INFO L276 IsEmpty]: Start isEmpty. Operand 64025 states and 98383 transitions. [2019-09-08 13:17:54,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-09-08 13:17:54,747 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:17:54,748 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:17:54,748 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:17:54,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:17:54,748 INFO L82 PathProgramCache]: Analyzing trace with hash -475137260, now seen corresponding path program 1 times [2019-09-08 13:17:54,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:17:54,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:17:54,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:17:54,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:17:54,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:17:54,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:17:55,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:17:55,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:17:55,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:17:55,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:17:55,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:17:55,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:17:55,031 INFO L87 Difference]: Start difference. First operand 64025 states and 98383 transitions. Second operand 4 states. [2019-09-08 13:17:58,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:17:58,533 INFO L93 Difference]: Finished difference Result 119611 states and 183539 transitions. [2019-09-08 13:17:58,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:17:58,533 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 264 [2019-09-08 13:17:58,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:17:58,595 INFO L225 Difference]: With dead ends: 119611 [2019-09-08 13:17:58,595 INFO L226 Difference]: Without dead ends: 57863 [2019-09-08 13:17:58,640 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:17:58,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57863 states. [2019-09-08 13:18:03,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57863 to 57787. [2019-09-08 13:18:03,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57787 states. [2019-09-08 13:18:03,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57787 states to 57787 states and 88748 transitions. [2019-09-08 13:18:03,506 INFO L78 Accepts]: Start accepts. Automaton has 57787 states and 88748 transitions. Word has length 264 [2019-09-08 13:18:03,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:18:03,506 INFO L475 AbstractCegarLoop]: Abstraction has 57787 states and 88748 transitions. [2019-09-08 13:18:03,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:18:03,506 INFO L276 IsEmpty]: Start isEmpty. Operand 57787 states and 88748 transitions. [2019-09-08 13:18:03,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-09-08 13:18:03,528 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:18:03,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] [2019-09-08 13:18:03,529 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:18:03,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:18:03,529 INFO L82 PathProgramCache]: Analyzing trace with hash -927753442, now seen corresponding path program 1 times [2019-09-08 13:18:03,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:18:03,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:18:03,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:03,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:18:03,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:03,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:18:03,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:18:03,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:18:03,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:18:03,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:18:03,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:18:03,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:18:03,725 INFO L87 Difference]: Start difference. First operand 57787 states and 88748 transitions. Second operand 3 states. [2019-09-08 13:18:09,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:18:09,246 INFO L93 Difference]: Finished difference Result 145079 states and 225096 transitions. [2019-09-08 13:18:09,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:18:09,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 264 [2019-09-08 13:18:09,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:18:09,362 INFO L225 Difference]: With dead ends: 145079 [2019-09-08 13:18:09,363 INFO L226 Difference]: Without dead ends: 94453 [2019-09-08 13:18:09,408 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:18:09,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94453 states. [2019-09-08 13:18:16,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94453 to 88035. [2019-09-08 13:18:16,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88035 states. [2019-09-08 13:18:16,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88035 states to 88035 states and 136200 transitions. [2019-09-08 13:18:16,423 INFO L78 Accepts]: Start accepts. Automaton has 88035 states and 136200 transitions. Word has length 264 [2019-09-08 13:18:16,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:18:16,424 INFO L475 AbstractCegarLoop]: Abstraction has 88035 states and 136200 transitions. [2019-09-08 13:18:16,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:18:16,424 INFO L276 IsEmpty]: Start isEmpty. Operand 88035 states and 136200 transitions. [2019-09-08 13:18:16,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-09-08 13:18:16,448 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:18:16,448 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 13:18:16,448 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:18:16,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:18:16,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1867808595, now seen corresponding path program 1 times [2019-09-08 13:18:16,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:18:16,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:18:16,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:16,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:18:16,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:16,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:18:16,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:18:16,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:18:16,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:18:16,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:18:16,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:18:16,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:18:16,694 INFO L87 Difference]: Start difference. First operand 88035 states and 136200 transitions. Second operand 3 states. [2019-09-08 13:18:28,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:18:28,391 INFO L93 Difference]: Finished difference Result 259560 states and 401316 transitions. [2019-09-08 13:18:28,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:18:28,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 265 [2019-09-08 13:18:28,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:18:28,643 INFO L225 Difference]: With dead ends: 259560 [2019-09-08 13:18:28,644 INFO L226 Difference]: Without dead ends: 172872 [2019-09-08 13:18:28,724 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:18:29,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172872 states. [2019-09-08 13:18:43,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172872 to 172870. [2019-09-08 13:18:43,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172870 states. [2019-09-08 13:18:43,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172870 states to 172870 states and 266091 transitions. [2019-09-08 13:18:43,477 INFO L78 Accepts]: Start accepts. Automaton has 172870 states and 266091 transitions. Word has length 265 [2019-09-08 13:18:43,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:18:43,477 INFO L475 AbstractCegarLoop]: Abstraction has 172870 states and 266091 transitions. [2019-09-08 13:18:43,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:18:43,478 INFO L276 IsEmpty]: Start isEmpty. Operand 172870 states and 266091 transitions. [2019-09-08 13:18:43,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-09-08 13:18:43,510 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:18:43,510 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 13:18:43,510 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:18:43,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:18:43,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1633445328, now seen corresponding path program 1 times [2019-09-08 13:18:43,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:18:43,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:18:43,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:43,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:18:43,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:43,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:18:43,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:18:43,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:18:43,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:18:43,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:18:43,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:18:43,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:18:43,723 INFO L87 Difference]: Start difference. First operand 172870 states and 266091 transitions. Second operand 4 states. [2019-09-08 13:19:05,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:19:05,810 INFO L93 Difference]: Finished difference Result 468448 states and 719538 transitions. [2019-09-08 13:19:05,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:19:05,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 265 [2019-09-08 13:19:05,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:19:06,244 INFO L225 Difference]: With dead ends: 468448 [2019-09-08 13:19:06,245 INFO L226 Difference]: Without dead ends: 298870 [2019-09-08 13:19:06,387 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:19:06,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298870 states. [2019-09-08 13:19:24,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298870 to 169090. [2019-09-08 13:19:24,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169090 states. [2019-09-08 13:19:24,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169090 states to 169090 states and 260147 transitions. [2019-09-08 13:19:24,624 INFO L78 Accepts]: Start accepts. Automaton has 169090 states and 260147 transitions. Word has length 265 [2019-09-08 13:19:24,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:19:24,624 INFO L475 AbstractCegarLoop]: Abstraction has 169090 states and 260147 transitions. [2019-09-08 13:19:24,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:19:24,624 INFO L276 IsEmpty]: Start isEmpty. Operand 169090 states and 260147 transitions. [2019-09-08 13:19:24,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-09-08 13:19:24,657 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:19:24,657 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:19:24,657 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:19:24,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:19:24,658 INFO L82 PathProgramCache]: Analyzing trace with hash 341064440, now seen corresponding path program 1 times [2019-09-08 13:19:24,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:19:24,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:19:24,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:19:24,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:19:24,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:19:24,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:19:24,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:19:24,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:19:24,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:19:24,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:19:24,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:19:24,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:19:24,828 INFO L87 Difference]: Start difference. First operand 169090 states and 260147 transitions. Second operand 3 states. [2019-09-08 13:19:48,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:19:48,872 INFO L93 Difference]: Finished difference Result 452161 states and 703273 transitions. [2019-09-08 13:19:48,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:19:48,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 267 [2019-09-08 13:19:48,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:19:49,368 INFO L225 Difference]: With dead ends: 452161 [2019-09-08 13:19:49,369 INFO L226 Difference]: Without dead ends: 295070 [2019-09-08 13:19:49,533 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:19:49,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295070 states. [2019-09-08 13:20:20,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295070 to 270708. [2019-09-08 13:20:20,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270708 states. [2019-09-08 13:20:20,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270708 states to 270708 states and 422976 transitions. [2019-09-08 13:20:20,707 INFO L78 Accepts]: Start accepts. Automaton has 270708 states and 422976 transitions. Word has length 267 [2019-09-08 13:20:20,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:20:20,707 INFO L475 AbstractCegarLoop]: Abstraction has 270708 states and 422976 transitions. [2019-09-08 13:20:20,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:20:20,707 INFO L276 IsEmpty]: Start isEmpty. Operand 270708 states and 422976 transitions. [2019-09-08 13:20:20,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-09-08 13:20:20,741 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:20:20,741 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:20:20,741 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:20:20,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:20:20,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1490717262, now seen corresponding path program 1 times [2019-09-08 13:20:20,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:20:20,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:20:20,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:20,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:20:20,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:20,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:20:21,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:20:21,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:20:21,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:20:21,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:20:21,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:20:21,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:20:21,129 INFO L87 Difference]: Start difference. First operand 270708 states and 422976 transitions. Second operand 4 states. [2019-09-08 13:21:07,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:21:07,434 INFO L93 Difference]: Finished difference Result 780555 states and 1220227 transitions. [2019-09-08 13:21:07,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:21:07,434 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 268 [2019-09-08 13:21:07,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:21:08,197 INFO L225 Difference]: With dead ends: 780555 [2019-09-08 13:21:08,197 INFO L226 Difference]: Without dead ends: 510065 [2019-09-08 13:21:08,409 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:21:08,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510065 states. [2019-09-08 13:21:58,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510065 to 510063. [2019-09-08 13:21:58,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510063 states. [2019-09-08 13:21:59,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510063 states to 510063 states and 793271 transitions. [2019-09-08 13:21:59,975 INFO L78 Accepts]: Start accepts. Automaton has 510063 states and 793271 transitions. Word has length 268 [2019-09-08 13:21:59,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:21:59,975 INFO L475 AbstractCegarLoop]: Abstraction has 510063 states and 793271 transitions. [2019-09-08 13:21:59,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:21:59,976 INFO L276 IsEmpty]: Start isEmpty. Operand 510063 states and 793271 transitions. [2019-09-08 13:22:00,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-09-08 13:22:00,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:22:00,041 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 13:22:00,041 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:22:00,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:22:00,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1388182148, now seen corresponding path program 1 times [2019-09-08 13:22:00,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:22:00,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:22:00,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:22:00,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:22:00,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:22:00,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:22:00,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 13:22:00,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:22:00,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:22:00,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:22:00,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:22:00,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:22:00,161 INFO L87 Difference]: Start difference. First operand 510063 states and 793271 transitions. Second operand 3 states. [2019-09-08 13:23:24,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:23:24,770 INFO L93 Difference]: Finished difference Result 1336394 states and 2075532 transitions. [2019-09-08 13:23:24,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:23:24,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 269 [2019-09-08 13:23:24,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:23:26,189 INFO L225 Difference]: With dead ends: 1336394 [2019-09-08 13:23:26,189 INFO L226 Difference]: Without dead ends: 871148 [2019-09-08 13:23:26,583 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:23:27,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871148 states. [2019-09-08 13:24:34,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871148 to 510862. [2019-09-08 13:24:34,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510862 states. [2019-09-08 13:24:35,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510862 states to 510862 states and 794258 transitions. [2019-09-08 13:24:35,825 INFO L78 Accepts]: Start accepts. Automaton has 510862 states and 794258 transitions. Word has length 269 [2019-09-08 13:24:35,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:24:35,825 INFO L475 AbstractCegarLoop]: Abstraction has 510862 states and 794258 transitions. [2019-09-08 13:24:35,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:24:35,826 INFO L276 IsEmpty]: Start isEmpty. Operand 510862 states and 794258 transitions. [2019-09-08 13:24:35,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-09-08 13:24:35,896 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:24:35,897 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:24:35,897 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:24:35,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:24:35,897 INFO L82 PathProgramCache]: Analyzing trace with hash -408395274, now seen corresponding path program 1 times [2019-09-08 13:24:35,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:24:35,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:24:35,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:24:35,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:24:35,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:24:35,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:24:36,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:24:36,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:24:36,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:24:36,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:24:36,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:24:36,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:24:36,126 INFO L87 Difference]: Start difference. First operand 510862 states and 794258 transitions. Second operand 3 states. [2019-09-08 13:26:21,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:26:21,195 INFO L93 Difference]: Finished difference Result 1507849 states and 2346195 transitions. [2019-09-08 13:26:21,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:26:21,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 270 [2019-09-08 13:26:21,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:26:22,965 INFO L225 Difference]: With dead ends: 1507849 [2019-09-08 13:26:22,965 INFO L226 Difference]: Without dead ends: 1002462 [2019-09-08 13:26:23,400 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:26:24,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002462 states. [2019-09-08 13:28:21,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002462 to 1002156. [2019-09-08 13:28:21,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1002156 states. [2019-09-08 13:28:23,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002156 states to 1002156 states and 1552371 transitions. [2019-09-08 13:28:23,257 INFO L78 Accepts]: Start accepts. Automaton has 1002156 states and 1552371 transitions. Word has length 270 [2019-09-08 13:28:23,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:28:23,257 INFO L475 AbstractCegarLoop]: Abstraction has 1002156 states and 1552371 transitions. [2019-09-08 13:28:23,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:28:23,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1002156 states and 1552371 transitions. [2019-09-08 13:28:23,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-09-08 13:28:23,403 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:28:23,403 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:28:23,403 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:28:23,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:28:23,404 INFO L82 PathProgramCache]: Analyzing trace with hash 336811379, now seen corresponding path program 1 times [2019-09-08 13:28:23,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:28:23,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:28:23,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:28:23,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:28:23,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:28:24,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:28:25,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:28:25,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:28:25,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:28:25,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:28:25,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:28:25,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:28:25,007 INFO L87 Difference]: Start difference. First operand 1002156 states and 1552371 transitions. Second operand 4 states.