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.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 13:20:06,362 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 13:20:06,364 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 13:20:06,376 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 13:20:06,377 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 13:20:06,378 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 13:20:06,379 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 13:20:06,381 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 13:20:06,382 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 13:20:06,383 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 13:20:06,384 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 13:20:06,385 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 13:20:06,385 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 13:20:06,386 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 13:20:06,387 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 13:20:06,388 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 13:20:06,389 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 13:20:06,390 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 13:20:06,392 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 13:20:06,394 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 13:20:06,395 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 13:20:06,396 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 13:20:06,397 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 13:20:06,398 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 13:20:06,400 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 13:20:06,401 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 13:20:06,401 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 13:20:06,402 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 13:20:06,402 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 13:20:06,403 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 13:20:06,403 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 13:20:06,404 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 13:20:06,405 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 13:20:06,406 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 13:20:06,407 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 13:20:06,407 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 13:20:06,407 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 13:20:06,408 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 13:20:06,408 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 13:20:06,409 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 13:20:06,409 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 13:20:06,410 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:20:06,425 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 13:20:06,426 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 13:20:06,427 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 13:20:06,427 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 13:20:06,427 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 13:20:06,427 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 13:20:06,428 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 13:20:06,428 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 13:20:06,428 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 13:20:06,428 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 13:20:06,428 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 13:20:06,429 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 13:20:06,429 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 13:20:06,429 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 13:20:06,429 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 13:20:06,429 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 13:20:06,430 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 13:20:06,430 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 13:20:06,430 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 13:20:06,430 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 13:20:06,430 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 13:20:06,431 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:20:06,431 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 13:20:06,431 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 13:20:06,431 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 13:20:06,431 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 13:20:06,432 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 13:20:06,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 13:20:06,432 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 13:20:06,472 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 13:20:06,495 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 13:20:06,499 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 13:20:06,502 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 13:20:06,503 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 13:20:06,503 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.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 13:20:06,580 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b225a0084/1b5267c242bd4307b69cc1feebc443ed/FLAG58195e607 [2019-09-08 13:20:07,221 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 13:20:07,223 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 13:20:07,253 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b225a0084/1b5267c242bd4307b69cc1feebc443ed/FLAG58195e607 [2019-09-08 13:20:07,427 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b225a0084/1b5267c242bd4307b69cc1feebc443ed [2019-09-08 13:20:07,440 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 13:20:07,442 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 13:20:07,443 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 13:20:07,444 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 13:20:07,447 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 13:20:07,448 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:20:07" (1/1) ... [2019-09-08 13:20:07,450 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@276553b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:20:07, skipping insertion in model container [2019-09-08 13:20:07,451 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:20:07" (1/1) ... [2019-09-08 13:20:07,458 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 13:20:07,574 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 13:20:08,620 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:20:08,635 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 13:20:09,068 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:20:09,125 INFO L192 MainTranslator]: Completed translation [2019-09-08 13:20:09,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:20:09 WrapperNode [2019-09-08 13:20:09,126 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 13:20:09,128 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 13:20:09,128 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 13:20:09,128 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 13:20:09,147 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:20:09" (1/1) ... [2019-09-08 13:20:09,147 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:20:09" (1/1) ... [2019-09-08 13:20:09,193 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:20:09" (1/1) ... [2019-09-08 13:20:09,193 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:20:09" (1/1) ... [2019-09-08 13:20:09,257 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:20:09" (1/1) ... [2019-09-08 13:20:09,296 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:20:09" (1/1) ... [2019-09-08 13:20:09,304 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:20:09" (1/1) ... [2019-09-08 13:20:09,316 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 13:20:09,317 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 13:20:09,317 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 13:20:09,317 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 13:20:09,319 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:20:09" (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:20:09,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 13:20:09,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 13:20:09,417 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 13:20:09,417 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 13:20:09,418 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 13:20:09,418 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 13:20:09,418 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 13:20:09,418 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 13:20:09,419 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 13:20:09,419 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 13:20:09,420 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 13:20:09,420 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 13:20:09,421 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 13:20:09,421 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 13:20:09,423 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 13:20:09,423 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 13:20:09,426 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 13:20:09,426 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 13:20:09,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 13:20:09,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 13:20:12,439 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 13:20:12,440 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 13:20:12,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:20:12 BoogieIcfgContainer [2019-09-08 13:20:12,442 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 13:20:12,444 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 13:20:12,444 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 13:20:12,448 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 13:20:12,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:20:07" (1/3) ... [2019-09-08 13:20:12,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bf8ce9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:20:12, skipping insertion in model container [2019-09-08 13:20:12,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:20:09" (2/3) ... [2019-09-08 13:20:12,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bf8ce9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:20:12, skipping insertion in model container [2019-09-08 13:20:12,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:20:12" (3/3) ... [2019-09-08 13:20:12,452 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 13:20:12,464 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 13:20:12,493 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 13:20:12,516 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 13:20:12,583 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 13:20:12,584 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 13:20:12,584 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 13:20:12,584 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 13:20:12,584 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 13:20:12,584 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 13:20:12,585 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 13:20:12,585 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 13:20:12,585 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 13:20:12,644 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states. [2019-09-08 13:20:12,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-08 13:20:12,689 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:20:12,693 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:20:12,696 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:20:12,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:20:12,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1949460245, now seen corresponding path program 1 times [2019-09-08 13:20:12,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:20:12,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:20:12,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:12,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:20:12,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:13,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:20:13,833 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:13,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:20:13,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:20:13,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:20:13,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:20:13,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:20:13,860 INFO L87 Difference]: Start difference. First operand 808 states. Second operand 3 states. [2019-09-08 13:20:14,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:20:14,303 INFO L93 Difference]: Finished difference Result 1527 states and 2683 transitions. [2019-09-08 13:20:14,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:20:14,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2019-09-08 13:20:14,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:20:14,380 INFO L225 Difference]: With dead ends: 1527 [2019-09-08 13:20:14,430 INFO L226 Difference]: Without dead ends: 1311 [2019-09-08 13:20:14,445 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:20:14,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1311 states. [2019-09-08 13:20:14,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1311 to 1309. [2019-09-08 13:20:14,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1309 states. [2019-09-08 13:20:14,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1309 states to 1309 states and 2040 transitions. [2019-09-08 13:20:14,612 INFO L78 Accepts]: Start accepts. Automaton has 1309 states and 2040 transitions. Word has length 330 [2019-09-08 13:20:14,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:20:14,614 INFO L475 AbstractCegarLoop]: Abstraction has 1309 states and 2040 transitions. [2019-09-08 13:20:14,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:20:14,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 2040 transitions. [2019-09-08 13:20:14,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-08 13:20:14,630 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:20:14,630 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:20:14,631 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:20:14,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:20:14,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1160300407, now seen corresponding path program 1 times [2019-09-08 13:20:14,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:20:14,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:20:14,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:14,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:20:14,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:14,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:20:15,022 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:15,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:20:15,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:20:15,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:20:15,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:20:15,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:20:15,025 INFO L87 Difference]: Start difference. First operand 1309 states and 2040 transitions. Second operand 3 states. [2019-09-08 13:20:15,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:20:15,307 INFO L93 Difference]: Finished difference Result 2595 states and 4073 transitions. [2019-09-08 13:20:15,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:20:15,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2019-09-08 13:20:15,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:20:15,325 INFO L225 Difference]: With dead ends: 2595 [2019-09-08 13:20:15,325 INFO L226 Difference]: Without dead ends: 2261 [2019-09-08 13:20:15,332 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:20:15,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2261 states. [2019-09-08 13:20:15,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2261 to 2259. [2019-09-08 13:20:15,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2259 states. [2019-09-08 13:20:15,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2259 states to 2259 states and 3512 transitions. [2019-09-08 13:20:15,444 INFO L78 Accepts]: Start accepts. Automaton has 2259 states and 3512 transitions. Word has length 330 [2019-09-08 13:20:15,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:20:15,446 INFO L475 AbstractCegarLoop]: Abstraction has 2259 states and 3512 transitions. [2019-09-08 13:20:15,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:20:15,447 INFO L276 IsEmpty]: Start isEmpty. Operand 2259 states and 3512 transitions. [2019-09-08 13:20:15,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-08 13:20:15,458 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:20:15,459 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:20:15,459 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:20:15,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:20:15,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1989837066, now seen corresponding path program 1 times [2019-09-08 13:20:15,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:20:15,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:20:15,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:15,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:20:15,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:15,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:20:16,334 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:16,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:20:16,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:20:16,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:20:16,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:20:16,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:20:16,338 INFO L87 Difference]: Start difference. First operand 2259 states and 3512 transitions. Second operand 4 states. [2019-09-08 13:20:16,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:20:16,683 INFO L93 Difference]: Finished difference Result 6670 states and 10361 transitions. [2019-09-08 13:20:16,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:20:16,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 330 [2019-09-08 13:20:16,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:20:16,714 INFO L225 Difference]: With dead ends: 6670 [2019-09-08 13:20:16,715 INFO L226 Difference]: Without dead ends: 4426 [2019-09-08 13:20:16,731 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:20:16,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4426 states. [2019-09-08 13:20:16,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4426 to 4424. [2019-09-08 13:20:16,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4424 states. [2019-09-08 13:20:16,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4424 states to 4424 states and 6838 transitions. [2019-09-08 13:20:16,936 INFO L78 Accepts]: Start accepts. Automaton has 4424 states and 6838 transitions. Word has length 330 [2019-09-08 13:20:16,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:20:16,936 INFO L475 AbstractCegarLoop]: Abstraction has 4424 states and 6838 transitions. [2019-09-08 13:20:16,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:20:16,937 INFO L276 IsEmpty]: Start isEmpty. Operand 4424 states and 6838 transitions. [2019-09-08 13:20:16,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-08 13:20:16,948 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:20:16,949 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:20:16,949 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:20:16,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:20:16,950 INFO L82 PathProgramCache]: Analyzing trace with hash -703078163, now seen corresponding path program 1 times [2019-09-08 13:20:16,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:20:16,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:20:16,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:16,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:20:16,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:16,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:20:17,280 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:17,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:20:17,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:20:17,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:20:17,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:20:17,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:20:17,283 INFO L87 Difference]: Start difference. First operand 4424 states and 6838 transitions. Second operand 3 states. [2019-09-08 13:20:17,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:20:17,739 INFO L93 Difference]: Finished difference Result 12971 states and 20002 transitions. [2019-09-08 13:20:17,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:20:17,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-09-08 13:20:17,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:20:17,785 INFO L225 Difference]: With dead ends: 12971 [2019-09-08 13:20:17,785 INFO L226 Difference]: Without dead ends: 8676 [2019-09-08 13:20:17,799 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:20:17,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8676 states. [2019-09-08 13:20:18,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8676 to 8674. [2019-09-08 13:20:18,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8674 states. [2019-09-08 13:20:18,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8674 states to 8674 states and 13331 transitions. [2019-09-08 13:20:18,270 INFO L78 Accepts]: Start accepts. Automaton has 8674 states and 13331 transitions. Word has length 332 [2019-09-08 13:20:18,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:20:18,270 INFO L475 AbstractCegarLoop]: Abstraction has 8674 states and 13331 transitions. [2019-09-08 13:20:18,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:20:18,270 INFO L276 IsEmpty]: Start isEmpty. Operand 8674 states and 13331 transitions. [2019-09-08 13:20:18,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-08 13:20:18,290 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:20:18,291 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:20:18,291 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:20:18,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:20:18,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1582910286, now seen corresponding path program 1 times [2019-09-08 13:20:18,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:20:18,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:20:18,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:18,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:20:18,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:18,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:20:18,481 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:18,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:20:18,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:20:18,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:20:18,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:20:18,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:20:18,483 INFO L87 Difference]: Start difference. First operand 8674 states and 13331 transitions. Second operand 3 states. [2019-09-08 13:20:19,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:20:19,198 INFO L93 Difference]: Finished difference Result 25947 states and 39869 transitions. [2019-09-08 13:20:19,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:20:19,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-09-08 13:20:19,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:20:19,300 INFO L225 Difference]: With dead ends: 25947 [2019-09-08 13:20:19,300 INFO L226 Difference]: Without dead ends: 17315 [2019-09-08 13:20:19,327 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:20:19,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17315 states. [2019-09-08 13:20:19,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17315 to 8693. [2019-09-08 13:20:19,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8693 states. [2019-09-08 13:20:19,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8693 states to 8693 states and 13359 transitions. [2019-09-08 13:20:19,880 INFO L78 Accepts]: Start accepts. Automaton has 8693 states and 13359 transitions. Word has length 332 [2019-09-08 13:20:19,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:20:19,880 INFO L475 AbstractCegarLoop]: Abstraction has 8693 states and 13359 transitions. [2019-09-08 13:20:19,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:20:19,881 INFO L276 IsEmpty]: Start isEmpty. Operand 8693 states and 13359 transitions. [2019-09-08 13:20:19,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-09-08 13:20:19,904 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:20:19,905 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:20:19,905 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:20:19,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:20:19,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1625546102, now seen corresponding path program 1 times [2019-09-08 13:20:19,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:20:19,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:20:19,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:19,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:20:19,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:20,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:20:20,129 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:20,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:20:20,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:20:20,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:20:20,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:20:20,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:20:20,131 INFO L87 Difference]: Start difference. First operand 8693 states and 13359 transitions. Second operand 3 states. [2019-09-08 13:20:20,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:20:20,738 INFO L93 Difference]: Finished difference Result 25966 states and 39890 transitions. [2019-09-08 13:20:20,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:20:20,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 333 [2019-09-08 13:20:20,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:20:20,789 INFO L225 Difference]: With dead ends: 25966 [2019-09-08 13:20:20,790 INFO L226 Difference]: Without dead ends: 17333 [2019-09-08 13:20:20,818 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:20:20,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17333 states. [2019-09-08 13:20:21,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17333 to 8711. [2019-09-08 13:20:21,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8711 states. [2019-09-08 13:20:21,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8711 states to 8711 states and 13380 transitions. [2019-09-08 13:20:21,506 INFO L78 Accepts]: Start accepts. Automaton has 8711 states and 13380 transitions. Word has length 333 [2019-09-08 13:20:21,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:20:21,507 INFO L475 AbstractCegarLoop]: Abstraction has 8711 states and 13380 transitions. [2019-09-08 13:20:21,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:20:21,507 INFO L276 IsEmpty]: Start isEmpty. Operand 8711 states and 13380 transitions. [2019-09-08 13:20:21,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-09-08 13:20:21,527 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:20:21,527 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:20:21,528 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:20:21,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:20:21,528 INFO L82 PathProgramCache]: Analyzing trace with hash 2091419944, now seen corresponding path program 1 times [2019-09-08 13:20:21,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:20:21,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:20:21,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:21,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:20:21,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:21,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:20:21,842 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,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:20:21,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:20:21,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:20:21,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:20:21,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:20:21,845 INFO L87 Difference]: Start difference. First operand 8711 states and 13380 transitions. Second operand 3 states. [2019-09-08 13:20:22,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:20:22,659 INFO L93 Difference]: Finished difference Result 25454 states and 38997 transitions. [2019-09-08 13:20:22,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:20:22,660 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 334 [2019-09-08 13:20:22,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:20:22,696 INFO L225 Difference]: With dead ends: 25454 [2019-09-08 13:20:22,697 INFO L226 Difference]: Without dead ends: 16988 [2019-09-08 13:20:22,715 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:20:22,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16988 states. [2019-09-08 13:20:23,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16988 to 16986. [2019-09-08 13:20:23,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16986 states. [2019-09-08 13:20:23,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16986 states to 16986 states and 25916 transitions. [2019-09-08 13:20:23,469 INFO L78 Accepts]: Start accepts. Automaton has 16986 states and 25916 transitions. Word has length 334 [2019-09-08 13:20:23,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:20:23,470 INFO L475 AbstractCegarLoop]: Abstraction has 16986 states and 25916 transitions. [2019-09-08 13:20:23,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:20:23,470 INFO L276 IsEmpty]: Start isEmpty. Operand 16986 states and 25916 transitions. [2019-09-08 13:20:23,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-09-08 13:20:23,503 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:20:23,503 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:20:23,503 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:20:23,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:20:23,504 INFO L82 PathProgramCache]: Analyzing trace with hash -7020987, now seen corresponding path program 1 times [2019-09-08 13:20:23,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:20:23,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:20:23,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:23,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:20:23,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:23,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:20:23,934 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:23,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:20:23,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:20:23,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:20:23,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:20:23,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:20:23,937 INFO L87 Difference]: Start difference. First operand 16986 states and 25916 transitions. Second operand 4 states. [2019-09-08 13:20:25,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:20:25,042 INFO L93 Difference]: Finished difference Result 48106 states and 73197 transitions. [2019-09-08 13:20:25,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:20:25,042 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 334 [2019-09-08 13:20:25,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:20:25,118 INFO L225 Difference]: With dead ends: 48106 [2019-09-08 13:20:25,118 INFO L226 Difference]: Without dead ends: 31660 [2019-09-08 13:20:25,160 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:20:25,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31660 states. [2019-09-08 13:20:27,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31660 to 17221. [2019-09-08 13:20:27,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17221 states. [2019-09-08 13:20:27,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17221 states to 17221 states and 26304 transitions. [2019-09-08 13:20:27,357 INFO L78 Accepts]: Start accepts. Automaton has 17221 states and 26304 transitions. Word has length 334 [2019-09-08 13:20:27,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:20:27,357 INFO L475 AbstractCegarLoop]: Abstraction has 17221 states and 26304 transitions. [2019-09-08 13:20:27,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:20:27,358 INFO L276 IsEmpty]: Start isEmpty. Operand 17221 states and 26304 transitions. [2019-09-08 13:20:27,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-09-08 13:20:27,395 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:20:27,396 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:20:27,396 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:20:27,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:20:27,396 INFO L82 PathProgramCache]: Analyzing trace with hash -154461326, now seen corresponding path program 1 times [2019-09-08 13:20:27,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:20:27,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:20:27,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:27,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:20:27,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:27,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:20:27,567 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:27,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:20:27,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:20:27,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:20:27,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:20:27,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:20:27,569 INFO L87 Difference]: Start difference. First operand 17221 states and 26304 transitions. Second operand 3 states. [2019-09-08 13:20:28,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:20:28,547 INFO L93 Difference]: Finished difference Result 42161 states and 64810 transitions. [2019-09-08 13:20:28,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:20:28,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2019-09-08 13:20:28,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:20:28,616 INFO L225 Difference]: With dead ends: 42161 [2019-09-08 13:20:28,616 INFO L226 Difference]: Without dead ends: 26695 [2019-09-08 13:20:28,654 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:20:28,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26695 states. [2019-09-08 13:20:29,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26695 to 21285. [2019-09-08 13:20:29,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21285 states. [2019-09-08 13:20:29,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21285 states to 21285 states and 33004 transitions. [2019-09-08 13:20:29,770 INFO L78 Accepts]: Start accepts. Automaton has 21285 states and 33004 transitions. Word has length 336 [2019-09-08 13:20:29,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:20:29,770 INFO L475 AbstractCegarLoop]: Abstraction has 21285 states and 33004 transitions. [2019-09-08 13:20:29,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:20:29,771 INFO L276 IsEmpty]: Start isEmpty. Operand 21285 states and 33004 transitions. [2019-09-08 13:20:29,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-09-08 13:20:29,815 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:20:29,816 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:20:29,816 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:20:29,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:20:29,817 INFO L82 PathProgramCache]: Analyzing trace with hash -106139639, now seen corresponding path program 1 times [2019-09-08 13:20:29,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:20:29,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:20:29,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:29,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:20:29,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:29,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:20:29,966 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:29,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:20:29,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:20:29,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:20:29,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:20:29,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:20:29,969 INFO L87 Difference]: Start difference. First operand 21285 states and 33004 transitions. Second operand 3 states. [2019-09-08 13:20:31,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:20:31,917 INFO L93 Difference]: Finished difference Result 62285 states and 96293 transitions. [2019-09-08 13:20:31,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:20:31,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2019-09-08 13:20:31,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:20:32,015 INFO L225 Difference]: With dead ends: 62285 [2019-09-08 13:20:32,015 INFO L226 Difference]: Without dead ends: 41803 [2019-09-08 13:20:32,056 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:20:32,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41803 states. [2019-09-08 13:20:33,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41803 to 21389. [2019-09-08 13:20:33,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21389 states. [2019-09-08 13:20:33,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21389 states to 21389 states and 33147 transitions. [2019-09-08 13:20:33,056 INFO L78 Accepts]: Start accepts. Automaton has 21389 states and 33147 transitions. Word has length 336 [2019-09-08 13:20:33,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:20:33,057 INFO L475 AbstractCegarLoop]: Abstraction has 21389 states and 33147 transitions. [2019-09-08 13:20:33,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:20:33,057 INFO L276 IsEmpty]: Start isEmpty. Operand 21389 states and 33147 transitions. [2019-09-08 13:20:33,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-09-08 13:20:33,101 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:20:33,102 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:20:33,102 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:20:33,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:20:33,103 INFO L82 PathProgramCache]: Analyzing trace with hash 921486183, now seen corresponding path program 1 times [2019-09-08 13:20:33,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:20:33,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:20:33,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:33,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:20:33,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:33,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:20:33,371 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:33,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:20:33,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:20:33,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:20:33,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:20:33,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:20:33,373 INFO L87 Difference]: Start difference. First operand 21389 states and 33147 transitions. Second operand 3 states. [2019-09-08 13:20:34,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:20:34,664 INFO L93 Difference]: Finished difference Result 62417 states and 96459 transitions. [2019-09-08 13:20:34,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:20:34,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 337 [2019-09-08 13:20:34,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:20:34,741 INFO L225 Difference]: With dead ends: 62417 [2019-09-08 13:20:34,741 INFO L226 Difference]: Without dead ends: 41928 [2019-09-08 13:20:34,786 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:20:34,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41928 states. [2019-09-08 13:20:36,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41928 to 21514. [2019-09-08 13:20:36,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21514 states. [2019-09-08 13:20:36,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21514 states to 21514 states and 33293 transitions. [2019-09-08 13:20:36,135 INFO L78 Accepts]: Start accepts. Automaton has 21514 states and 33293 transitions. Word has length 337 [2019-09-08 13:20:36,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:20:36,136 INFO L475 AbstractCegarLoop]: Abstraction has 21514 states and 33293 transitions. [2019-09-08 13:20:36,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:20:36,136 INFO L276 IsEmpty]: Start isEmpty. Operand 21514 states and 33293 transitions. [2019-09-08 13:20:36,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-09-08 13:20:36,155 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:20:36,155 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:20:36,155 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:20:36,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:20:36,156 INFO L82 PathProgramCache]: Analyzing trace with hash -936344161, now seen corresponding path program 1 times [2019-09-08 13:20:36,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:20:36,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:20:36,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:36,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:20:36,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:36,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:20:36,353 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:36,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:20:36,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:20:36,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:20:36,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:20:36,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:20:36,355 INFO L87 Difference]: Start difference. First operand 21514 states and 33293 transitions. Second operand 3 states. [2019-09-08 13:20:37,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:20:37,772 INFO L93 Difference]: Finished difference Result 52478 states and 81839 transitions. [2019-09-08 13:20:37,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:20:37,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 338 [2019-09-08 13:20:37,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:20:37,824 INFO L225 Difference]: With dead ends: 52478 [2019-09-08 13:20:37,824 INFO L226 Difference]: Without dead ends: 33260 [2019-09-08 13:20:37,853 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:20:37,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33260 states. [2019-09-08 13:20:39,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33260 to 28778. [2019-09-08 13:20:39,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28778 states. [2019-09-08 13:20:39,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28778 states to 28778 states and 45209 transitions. [2019-09-08 13:20:39,097 INFO L78 Accepts]: Start accepts. Automaton has 28778 states and 45209 transitions. Word has length 338 [2019-09-08 13:20:39,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:20:39,097 INFO L475 AbstractCegarLoop]: Abstraction has 28778 states and 45209 transitions. [2019-09-08 13:20:39,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:20:39,098 INFO L276 IsEmpty]: Start isEmpty. Operand 28778 states and 45209 transitions. [2019-09-08 13:20:39,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-09-08 13:20:39,111 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:20:39,111 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:20:39,112 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:20:39,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:20:39,112 INFO L82 PathProgramCache]: Analyzing trace with hash -531089956, now seen corresponding path program 1 times [2019-09-08 13:20:39,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:20:39,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:20:39,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:39,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:20:39,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:20:40,308 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:40,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:20:40,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:20:40,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:20:40,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:20:40,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:20:40,311 INFO L87 Difference]: Start difference. First operand 28778 states and 45209 transitions. Second operand 4 states. [2019-09-08 13:20:41,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:20:41,367 INFO L93 Difference]: Finished difference Result 53302 states and 83605 transitions. [2019-09-08 13:20:41,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:20:41,368 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 338 [2019-09-08 13:20:41,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:20:41,401 INFO L225 Difference]: With dead ends: 53302 [2019-09-08 13:20:41,401 INFO L226 Difference]: Without dead ends: 25387 [2019-09-08 13:20:41,432 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:20:41,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25387 states. [2019-09-08 13:20:42,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25387 to 25367. [2019-09-08 13:20:42,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25367 states. [2019-09-08 13:20:42,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25367 states to 25367 states and 39813 transitions. [2019-09-08 13:20:42,696 INFO L78 Accepts]: Start accepts. Automaton has 25367 states and 39813 transitions. Word has length 338 [2019-09-08 13:20:42,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:20:42,697 INFO L475 AbstractCegarLoop]: Abstraction has 25367 states and 39813 transitions. [2019-09-08 13:20:42,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:20:42,697 INFO L276 IsEmpty]: Start isEmpty. Operand 25367 states and 39813 transitions. [2019-09-08 13:20:42,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-09-08 13:20:42,713 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:20:42,714 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:20:42,714 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:20:42,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:20:42,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1972395214, now seen corresponding path program 1 times [2019-09-08 13:20:42,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:20:42,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:20:42,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:42,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:20:42,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:42,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:20:43,331 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:43,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:20:43,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 13:20:43,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 13:20:43,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 13:20:43,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 13:20:43,335 INFO L87 Difference]: Start difference. First operand 25367 states and 39813 transitions. Second operand 8 states. [2019-09-08 13:20:54,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:20:54,357 INFO L93 Difference]: Finished difference Result 148438 states and 236288 transitions. [2019-09-08 13:20:54,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 13:20:54,357 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 339 [2019-09-08 13:20:54,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:20:54,548 INFO L225 Difference]: With dead ends: 148438 [2019-09-08 13:20:54,548 INFO L226 Difference]: Without dead ends: 133708 [2019-09-08 13:20:54,585 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2019-09-08 13:20:54,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133708 states. [2019-09-08 13:20:58,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133708 to 65842. [2019-09-08 13:20:58,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65842 states. [2019-09-08 13:20:58,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65842 states to 65842 states and 102884 transitions. [2019-09-08 13:20:58,752 INFO L78 Accepts]: Start accepts. Automaton has 65842 states and 102884 transitions. Word has length 339 [2019-09-08 13:20:58,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:20:58,753 INFO L475 AbstractCegarLoop]: Abstraction has 65842 states and 102884 transitions. [2019-09-08 13:20:58,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 13:20:58,753 INFO L276 IsEmpty]: Start isEmpty. Operand 65842 states and 102884 transitions. [2019-09-08 13:20:58,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-09-08 13:20:58,794 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:20:58,794 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58,794 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:20:58,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:20:58,795 INFO L82 PathProgramCache]: Analyzing trace with hash 842249463, now seen corresponding path program 1 times [2019-09-08 13:20:58,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:20:58,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:20:58,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:58,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:20:58,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:58,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:20:59,571 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:59,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:20:59,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 13:20:59,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 13:20:59,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 13:20:59,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-08 13:20:59,574 INFO L87 Difference]: Start difference. First operand 65842 states and 102884 transitions. Second operand 10 states. [2019-09-08 13:21:13,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:21:13,896 INFO L93 Difference]: Finished difference Result 237128 states and 375243 transitions. [2019-09-08 13:21:13,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 13:21:13,897 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 339 [2019-09-08 13:21:13,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:21:14,136 INFO L225 Difference]: With dead ends: 237128 [2019-09-08 13:21:14,137 INFO L226 Difference]: Without dead ends: 173751 [2019-09-08 13:21:14,208 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2019-09-08 13:21:14,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173751 states. [2019-09-08 13:21:24,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173751 to 106907. [2019-09-08 13:21:24,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106907 states. [2019-09-08 13:21:24,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106907 states to 106907 states and 166544 transitions. [2019-09-08 13:21:24,218 INFO L78 Accepts]: Start accepts. Automaton has 106907 states and 166544 transitions. Word has length 339 [2019-09-08 13:21:24,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:21:24,218 INFO L475 AbstractCegarLoop]: Abstraction has 106907 states and 166544 transitions. [2019-09-08 13:21:24,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 13:21:24,218 INFO L276 IsEmpty]: Start isEmpty. Operand 106907 states and 166544 transitions. [2019-09-08 13:21:24,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-09-08 13:21:24,251 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:21:24,251 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:21:24,252 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:21:24,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:21:24,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1978603445, now seen corresponding path program 1 times [2019-09-08 13:21:24,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:21:24,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:21:24,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:24,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:21:24,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:24,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:21:24,731 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:21:24,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:21:24,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:21:24,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:21:24,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:21:24,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:21:24,735 INFO L87 Difference]: Start difference. First operand 106907 states and 166544 transitions. Second operand 4 states. [2019-09-08 13:21:33,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:21:33,237 INFO L93 Difference]: Finished difference Result 199079 states and 315408 transitions. [2019-09-08 13:21:33,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:21:33,237 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 339 [2019-09-08 13:21:33,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:21:33,446 INFO L225 Difference]: With dead ends: 199079 [2019-09-08 13:21:33,446 INFO L226 Difference]: Without dead ends: 126917 [2019-09-08 13:21:33,532 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:21:33,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126917 states. [2019-09-08 13:21:41,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126917 to 80433. [2019-09-08 13:21:41,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80433 states. [2019-09-08 13:21:41,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80433 states to 80433 states and 125918 transitions. [2019-09-08 13:21:41,758 INFO L78 Accepts]: Start accepts. Automaton has 80433 states and 125918 transitions. Word has length 339 [2019-09-08 13:21:41,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:21:41,759 INFO L475 AbstractCegarLoop]: Abstraction has 80433 states and 125918 transitions. [2019-09-08 13:21:41,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:21:41,759 INFO L276 IsEmpty]: Start isEmpty. Operand 80433 states and 125918 transitions. [2019-09-08 13:21:41,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-09-08 13:21:41,782 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:21:41,782 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:21:41,782 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:21:41,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:21:41,783 INFO L82 PathProgramCache]: Analyzing trace with hash 848457694, now seen corresponding path program 1 times [2019-09-08 13:21:41,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:21:41,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:21:41,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:41,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:21:41,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:42,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:21:42,649 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:21:42,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:21:42,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:21:42,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:21:42,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:21:42,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:21:42,651 INFO L87 Difference]: Start difference. First operand 80433 states and 125918 transitions. Second operand 4 states. [2019-09-08 13:21:53,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:21:53,941 INFO L93 Difference]: Finished difference Result 237822 states and 372252 transitions. [2019-09-08 13:21:53,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:21:53,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 339 [2019-09-08 13:21:53,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:21:54,178 INFO L225 Difference]: With dead ends: 237822 [2019-09-08 13:21:54,179 INFO L226 Difference]: Without dead ends: 157461 [2019-09-08 13:21:54,261 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:54,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157461 states. [2019-09-08 13:22:08,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157461 to 157459. [2019-09-08 13:22:08,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157459 states. [2019-09-08 13:22:08,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157459 states to 157459 states and 245349 transitions. [2019-09-08 13:22:08,876 INFO L78 Accepts]: Start accepts. Automaton has 157459 states and 245349 transitions. Word has length 339 [2019-09-08 13:22:08,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:22:08,876 INFO L475 AbstractCegarLoop]: Abstraction has 157459 states and 245349 transitions. [2019-09-08 13:22:08,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:22:08,876 INFO L276 IsEmpty]: Start isEmpty. Operand 157459 states and 245349 transitions. [2019-09-08 13:22:08,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2019-09-08 13:22:08,928 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:22:08,928 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:22:08,928 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:22:08,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:22:08,928 INFO L82 PathProgramCache]: Analyzing trace with hash -591706562, now seen corresponding path program 1 times [2019-09-08 13:22:08,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:22:08,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:22:08,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:22:08,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:22:08,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:22:08,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:22:09,179 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:09,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:22:09,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:22:09,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:22:09,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:22:09,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:22:09,181 INFO L87 Difference]: Start difference. First operand 157459 states and 245349 transitions. Second operand 3 states. [2019-09-08 13:22:34,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:22:34,729 INFO L93 Difference]: Finished difference Result 464527 states and 724001 transitions. [2019-09-08 13:22:34,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:22:34,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 341 [2019-09-08 13:22:34,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:22:35,212 INFO L225 Difference]: With dead ends: 464527 [2019-09-08 13:22:35,212 INFO L226 Difference]: Without dead ends: 308317 [2019-09-08 13:22:35,358 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:22:35,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308317 states. [2019-09-08 13:23:03,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308317 to 308315. [2019-09-08 13:23:03,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308315 states. [2019-09-08 13:23:04,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308315 states to 308315 states and 478840 transitions. [2019-09-08 13:23:04,082 INFO L78 Accepts]: Start accepts. Automaton has 308315 states and 478840 transitions. Word has length 341 [2019-09-08 13:23:04,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:23:04,083 INFO L475 AbstractCegarLoop]: Abstraction has 308315 states and 478840 transitions. [2019-09-08 13:23:04,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:23:04,083 INFO L276 IsEmpty]: Start isEmpty. Operand 308315 states and 478840 transitions. [2019-09-08 13:23:04,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2019-09-08 13:23:04,176 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:23:04,176 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:23:04,176 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:23:04,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:23:04,177 INFO L82 PathProgramCache]: Analyzing trace with hash -562766645, now seen corresponding path program 1 times [2019-09-08 13:23:04,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:23:04,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:23:04,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:23:04,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:23:04,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:23:04,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:23:04,385 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:23:04,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:23:04,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:23:04,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:23:04,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:23:04,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:23:04,388 INFO L87 Difference]: Start difference. First operand 308315 states and 478840 transitions. Second operand 3 states. [2019-09-08 13:23:52,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:23:52,756 INFO L93 Difference]: Finished difference Result 828287 states and 1296278 transitions. [2019-09-08 13:23:52,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:23:52,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 342 [2019-09-08 13:23:52,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:23:53,562 INFO L225 Difference]: With dead ends: 828287 [2019-09-08 13:23:53,563 INFO L226 Difference]: Without dead ends: 527133 [2019-09-08 13:23:53,788 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:54,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527133 states. [2019-09-08 13:24:49,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527133 to 478523. [2019-09-08 13:24:49,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478523 states. [2019-09-08 13:24:50,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478523 states to 478523 states and 748912 transitions. [2019-09-08 13:24:50,120 INFO L78 Accepts]: Start accepts. Automaton has 478523 states and 748912 transitions. Word has length 342 [2019-09-08 13:24:50,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:24:50,120 INFO L475 AbstractCegarLoop]: Abstraction has 478523 states and 748912 transitions. [2019-09-08 13:24:50,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:24:50,121 INFO L276 IsEmpty]: Start isEmpty. Operand 478523 states and 748912 transitions. [2019-09-08 13:24:50,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2019-09-08 13:24:50,232 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:24:50,232 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:24:50,232 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:24:50,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:24:50,233 INFO L82 PathProgramCache]: Analyzing trace with hash 212441379, now seen corresponding path program 1 times [2019-09-08 13:24:50,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:24:50,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:24:50,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:24:50,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:24:50,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:24:50,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:24:50,481 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:50,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:24:50,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:24:50,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:24:50,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:24:50,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:24:50,483 INFO L87 Difference]: Start difference. First operand 478523 states and 748912 transitions. Second operand 3 states. [2019-09-08 13:26:23,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:26:23,187 INFO L93 Difference]: Finished difference Result 1416896 states and 2217172 transitions. [2019-09-08 13:26:23,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:26:23,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 343 [2019-09-08 13:26:23,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:26:24,999 INFO L225 Difference]: With dead ends: 1416896 [2019-09-08 13:26:24,999 INFO L226 Difference]: Without dead ends: 939720 [2019-09-08 13:26:26,414 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:27,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939720 states. [2019-09-08 13:28:26,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939720 to 939718. [2019-09-08 13:28:26,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 939718 states. [2019-09-08 13:28:28,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939718 states to 939718 states and 1463075 transitions. [2019-09-08 13:28:28,441 INFO L78 Accepts]: Start accepts. Automaton has 939718 states and 1463075 transitions. Word has length 343 [2019-09-08 13:28:28,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:28:28,441 INFO L475 AbstractCegarLoop]: Abstraction has 939718 states and 1463075 transitions. [2019-09-08 13:28:28,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:28:28,441 INFO L276 IsEmpty]: Start isEmpty. Operand 939718 states and 1463075 transitions. [2019-09-08 13:28:28,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2019-09-08 13:28:28,657 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:28:28,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28,657 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:28:28,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:28:28,657 INFO L82 PathProgramCache]: Analyzing trace with hash 816167270, now seen corresponding path program 1 times [2019-09-08 13:28:28,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:28:28,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:28:28,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:28:28,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:28:28,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:28:28,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:28:29,017 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:29,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:28:29,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:28:29,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:28:29,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:28:29,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:28:29,019 INFO L87 Difference]: Start difference. First operand 939718 states and 1463075 transitions. Second operand 4 states.