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_floodmax.5.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 10:12:48,642 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 10:12:48,644 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 10:12:48,655 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 10:12:48,656 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 10:12:48,657 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 10:12:48,658 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 10:12:48,660 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 10:12:48,661 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 10:12:48,662 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 10:12:48,663 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 10:12:48,664 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 10:12:48,665 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 10:12:48,665 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 10:12:48,666 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 10:12:48,668 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 10:12:48,668 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 10:12:48,669 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 10:12:48,672 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 10:12:48,676 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 10:12:48,678 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 10:12:48,681 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 10:12:48,683 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 10:12:48,685 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 10:12:48,689 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 10:12:48,690 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 10:12:48,690 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 10:12:48,692 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 10:12:48,693 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 10:12:48,694 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 10:12:48,695 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 10:12:48,696 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 10:12:48,697 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 10:12:48,697 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 10:12:48,698 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 10:12:48,699 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 10:12:48,699 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 10:12:48,700 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 10:12:48,700 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 10:12:48,701 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 10:12:48,701 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 10:12:48,702 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 10:12:48,718 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 10:12:48,718 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 10:12:48,719 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 10:12:48,720 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 10:12:48,720 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 10:12:48,720 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 10:12:48,720 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 10:12:48,720 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 10:12:48,721 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 10:12:48,721 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 10:12:48,721 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 10:12:48,722 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 10:12:48,723 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 10:12:48,723 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 10:12:48,723 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 10:12:48,723 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 10:12:48,723 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 10:12:48,724 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 10:12:48,724 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 10:12:48,724 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 10:12:48,724 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 10:12:48,725 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:12:48,725 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 10:12:48,725 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 10:12:48,725 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 10:12:48,725 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 10:12:48,726 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 10:12:48,726 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 10:12:48,726 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 10:12:48,776 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 10:12:48,786 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 10:12:48,791 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 10:12:48,794 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 10:12:48,794 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 10:12:48,795 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.5.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 10:12:48,868 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47644c58d/ccbf80d9098e4997ac3439afd5f45463/FLAGbb65ecd39 [2019-09-08 10:12:49,610 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 10:12:49,612 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.5.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 10:12:49,640 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47644c58d/ccbf80d9098e4997ac3439afd5f45463/FLAGbb65ecd39 [2019-09-08 10:12:49,727 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47644c58d/ccbf80d9098e4997ac3439afd5f45463 [2019-09-08 10:12:49,735 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 10:12:49,737 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 10:12:49,738 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 10:12:49,738 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 10:12:49,742 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 10:12:49,743 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:12:49" (1/1) ... [2019-09-08 10:12:49,745 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ef9449c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:12:49, skipping insertion in model container [2019-09-08 10:12:49,746 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:12:49" (1/1) ... [2019-09-08 10:12:49,751 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 10:12:49,938 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 10:12:51,347 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:12:51,370 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 10:12:52,920 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:12:52,965 INFO L192 MainTranslator]: Completed translation [2019-09-08 10:12:52,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:12:52 WrapperNode [2019-09-08 10:12:52,966 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 10:12:52,967 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 10:12:52,968 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 10:12:52,968 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 10:12:52,983 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:12:52" (1/1) ... [2019-09-08 10:12:52,984 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:12:52" (1/1) ... [2019-09-08 10:12:53,035 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:12:52" (1/1) ... [2019-09-08 10:12:53,038 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:12:52" (1/1) ... [2019-09-08 10:12:53,107 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:12:52" (1/1) ... [2019-09-08 10:12:53,148 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:12:52" (1/1) ... [2019-09-08 10:12:53,170 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:12:52" (1/1) ... [2019-09-08 10:12:53,195 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 10:12:53,196 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 10:12:53,196 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 10:12:53,196 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 10:12:53,197 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:12:52" (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 10:12:53,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 10:12:53,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 10:12:53,268 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 10:12:53,268 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 10:12:53,269 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 10:12:53,269 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 10:12:53,269 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 10:12:53,270 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 10:12:53,270 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 10:12:53,271 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 10:12:53,271 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 10:12:53,271 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 10:12:53,272 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 10:12:53,272 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 10:12:53,273 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 10:12:53,273 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 10:12:53,275 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 10:12:53,275 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 10:12:53,275 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 10:12:53,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 10:12:53,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 10:12:57,338 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 10:12:57,339 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 10:12:57,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:12:57 BoogieIcfgContainer [2019-09-08 10:12:57,341 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 10:12:57,342 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 10:12:57,342 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 10:12:57,345 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 10:12:57,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:12:49" (1/3) ... [2019-09-08 10:12:57,346 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8e1c42d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:12:57, skipping insertion in model container [2019-09-08 10:12:57,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:12:52" (2/3) ... [2019-09-08 10:12:57,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8e1c42d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:12:57, skipping insertion in model container [2019-09-08 10:12:57,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:12:57" (3/3) ... [2019-09-08 10:12:57,353 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.5.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 10:12:57,363 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 10:12:57,373 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 10:12:57,389 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 10:12:57,431 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 10:12:57,431 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 10:12:57,432 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 10:12:57,432 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 10:12:57,432 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 10:12:57,432 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 10:12:57,432 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 10:12:57,432 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 10:12:57,433 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 10:12:57,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states. [2019-09-08 10:12:57,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2019-09-08 10:12:57,525 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:12:57,526 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:12:57,529 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:12:57,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:12:57,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1569501097, now seen corresponding path program 1 times [2019-09-08 10:12:57,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:12:57,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:12:57,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:12:57,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:12:57,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:12:58,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:12:58,903 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 10:12:58,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:12:58,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:12:58,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:12:58,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:12:58,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:12:58,927 INFO L87 Difference]: Start difference. First operand 1340 states. Second operand 3 states. [2019-09-08 10:12:59,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:12:59,386 INFO L93 Difference]: Finished difference Result 2262 states and 4032 transitions. [2019-09-08 10:12:59,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:12:59,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 476 [2019-09-08 10:12:59,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:12:59,468 INFO L225 Difference]: With dead ends: 2262 [2019-09-08 10:12:59,468 INFO L226 Difference]: Without dead ends: 1993 [2019-09-08 10:12:59,483 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 10:12:59,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1993 states. [2019-09-08 10:12:59,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1993 to 1991. [2019-09-08 10:12:59,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1991 states. [2019-09-08 10:12:59,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1991 states to 1991 states and 3230 transitions. [2019-09-08 10:12:59,681 INFO L78 Accepts]: Start accepts. Automaton has 1991 states and 3230 transitions. Word has length 476 [2019-09-08 10:12:59,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:12:59,683 INFO L475 AbstractCegarLoop]: Abstraction has 1991 states and 3230 transitions. [2019-09-08 10:12:59,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:12:59,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1991 states and 3230 transitions. [2019-09-08 10:12:59,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2019-09-08 10:12:59,700 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:12:59,700 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:12:59,701 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:12:59,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:12:59,703 INFO L82 PathProgramCache]: Analyzing trace with hash -534642427, now seen corresponding path program 1 times [2019-09-08 10:12:59,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:12:59,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:12:59,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:12:59,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:12:59,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:00,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:13:01,406 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 10:13:01,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:13:01,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:13:01,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:13:01,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:13:01,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:13:01,410 INFO L87 Difference]: Start difference. First operand 1991 states and 3230 transitions. Second operand 4 states. [2019-09-08 10:13:01,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:13:01,846 INFO L93 Difference]: Finished difference Result 5904 states and 9579 transitions. [2019-09-08 10:13:01,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:13:01,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 476 [2019-09-08 10:13:01,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:13:01,877 INFO L225 Difference]: With dead ends: 5904 [2019-09-08 10:13:01,877 INFO L226 Difference]: Without dead ends: 3930 [2019-09-08 10:13:01,889 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 10:13:01,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3930 states. [2019-09-08 10:13:02,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3930 to 3928. [2019-09-08 10:13:02,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3928 states. [2019-09-08 10:13:02,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3928 states to 3928 states and 6348 transitions. [2019-09-08 10:13:02,074 INFO L78 Accepts]: Start accepts. Automaton has 3928 states and 6348 transitions. Word has length 476 [2019-09-08 10:13:02,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:13:02,076 INFO L475 AbstractCegarLoop]: Abstraction has 3928 states and 6348 transitions. [2019-09-08 10:13:02,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:13:02,076 INFO L276 IsEmpty]: Start isEmpty. Operand 3928 states and 6348 transitions. [2019-09-08 10:13:02,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2019-09-08 10:13:02,089 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:13:02,090 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:13:02,090 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:13:02,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:13:02,092 INFO L82 PathProgramCache]: Analyzing trace with hash 107997406, now seen corresponding path program 1 times [2019-09-08 10:13:02,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:13:02,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:13:02,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:02,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:13:02,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:02,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:13:02,821 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 10:13:02,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:13:02,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:13:02,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:13:02,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:13:02,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:13:02,827 INFO L87 Difference]: Start difference. First operand 3928 states and 6348 transitions. Second operand 3 states. [2019-09-08 10:13:03,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:13:03,331 INFO L93 Difference]: Finished difference Result 11482 states and 18513 transitions. [2019-09-08 10:13:03,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:13:03,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 478 [2019-09-08 10:13:03,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:13:03,377 INFO L225 Difference]: With dead ends: 11482 [2019-09-08 10:13:03,386 INFO L226 Difference]: Without dead ends: 7768 [2019-09-08 10:13:03,400 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:13:03,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7768 states. [2019-09-08 10:13:03,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7768 to 7766. [2019-09-08 10:13:03,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7766 states. [2019-09-08 10:13:03,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7766 states to 7766 states and 12509 transitions. [2019-09-08 10:13:03,918 INFO L78 Accepts]: Start accepts. Automaton has 7766 states and 12509 transitions. Word has length 478 [2019-09-08 10:13:03,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:13:03,919 INFO L475 AbstractCegarLoop]: Abstraction has 7766 states and 12509 transitions. [2019-09-08 10:13:03,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:13:03,919 INFO L276 IsEmpty]: Start isEmpty. Operand 7766 states and 12509 transitions. [2019-09-08 10:13:03,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2019-09-08 10:13:03,940 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:13:03,941 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:13:03,941 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:13:03,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:13:03,942 INFO L82 PathProgramCache]: Analyzing trace with hash 2062931718, now seen corresponding path program 1 times [2019-09-08 10:13:03,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:13:03,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:13:03,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:03,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:13:03,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:03,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:13:04,199 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 10:13:04,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:13:04,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:13:04,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:13:04,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:13:04,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:13:04,203 INFO L87 Difference]: Start difference. First operand 7766 states and 12509 transitions. Second operand 3 states. [2019-09-08 10:13:04,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:13:04,921 INFO L93 Difference]: Finished difference Result 23201 states and 37359 transitions. [2019-09-08 10:13:04,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:13:04,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 479 [2019-09-08 10:13:04,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:13:05,028 INFO L225 Difference]: With dead ends: 23201 [2019-09-08 10:13:05,029 INFO L226 Difference]: Without dead ends: 15487 [2019-09-08 10:13:05,054 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 10:13:05,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15487 states. [2019-09-08 10:13:06,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15487 to 7813. [2019-09-08 10:13:06,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7813 states. [2019-09-08 10:13:06,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7813 states to 7813 states and 12583 transitions. [2019-09-08 10:13:06,203 INFO L78 Accepts]: Start accepts. Automaton has 7813 states and 12583 transitions. Word has length 479 [2019-09-08 10:13:06,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:13:06,204 INFO L475 AbstractCegarLoop]: Abstraction has 7813 states and 12583 transitions. [2019-09-08 10:13:06,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:13:06,204 INFO L276 IsEmpty]: Start isEmpty. Operand 7813 states and 12583 transitions. [2019-09-08 10:13:06,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2019-09-08 10:13:06,224 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:13:06,225 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:13:06,225 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:13:06,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:13:06,226 INFO L82 PathProgramCache]: Analyzing trace with hash -766778663, now seen corresponding path program 1 times [2019-09-08 10:13:06,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:13:06,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:13:06,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:06,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:13:06,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:06,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:13:06,736 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 10:13:06,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:13:06,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:13:06,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:13:06,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:13:06,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:13:06,738 INFO L87 Difference]: Start difference. First operand 7813 states and 12583 transitions. Second operand 3 states. [2019-09-08 10:13:07,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:13:07,527 INFO L93 Difference]: Finished difference Result 22716 states and 36476 transitions. [2019-09-08 10:13:07,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:13:07,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 480 [2019-09-08 10:13:07,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:13:07,572 INFO L225 Difference]: With dead ends: 22716 [2019-09-08 10:13:07,572 INFO L226 Difference]: Without dead ends: 15302 [2019-09-08 10:13:07,594 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 10:13:07,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15302 states. [2019-09-08 10:13:08,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15302 to 15300. [2019-09-08 10:13:08,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15300 states. [2019-09-08 10:13:08,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15300 states to 15300 states and 24521 transitions. [2019-09-08 10:13:08,282 INFO L78 Accepts]: Start accepts. Automaton has 15300 states and 24521 transitions. Word has length 480 [2019-09-08 10:13:08,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:13:08,283 INFO L475 AbstractCegarLoop]: Abstraction has 15300 states and 24521 transitions. [2019-09-08 10:13:08,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:13:08,283 INFO L276 IsEmpty]: Start isEmpty. Operand 15300 states and 24521 transitions. [2019-09-08 10:13:08,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2019-09-08 10:13:08,318 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:13:08,318 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:13:08,319 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:13:08,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:13:08,319 INFO L82 PathProgramCache]: Analyzing trace with hash -92545186, now seen corresponding path program 1 times [2019-09-08 10:13:08,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:13:08,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:13:08,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:08,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:13:08,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:08,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:13:08,724 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 10:13:08,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:13:08,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:13:08,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:13:08,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:13:08,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:13:08,726 INFO L87 Difference]: Start difference. First operand 15300 states and 24521 transitions. Second operand 3 states. [2019-09-08 10:13:09,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:13:09,663 INFO L93 Difference]: Finished difference Result 45644 states and 73118 transitions. [2019-09-08 10:13:09,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:13:09,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 480 [2019-09-08 10:13:09,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:13:09,737 INFO L225 Difference]: With dead ends: 45644 [2019-09-08 10:13:09,738 INFO L226 Difference]: Without dead ends: 30488 [2019-09-08 10:13:09,780 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 10:13:09,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30488 states. [2019-09-08 10:13:11,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30488 to 15398. [2019-09-08 10:13:11,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15398 states. [2019-09-08 10:13:11,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15398 states to 15398 states and 24672 transitions. [2019-09-08 10:13:11,276 INFO L78 Accepts]: Start accepts. Automaton has 15398 states and 24672 transitions. Word has length 480 [2019-09-08 10:13:11,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:13:11,277 INFO L475 AbstractCegarLoop]: Abstraction has 15398 states and 24672 transitions. [2019-09-08 10:13:11,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:13:11,277 INFO L276 IsEmpty]: Start isEmpty. Operand 15398 states and 24672 transitions. [2019-09-08 10:13:11,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2019-09-08 10:13:11,312 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:13:11,313 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:13:11,313 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:13:11,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:13:11,318 INFO L82 PathProgramCache]: Analyzing trace with hash 229871095, now seen corresponding path program 1 times [2019-09-08 10:13:11,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:13:11,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:13:11,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:11,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:13:11,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:11,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:13:11,587 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 10:13:11,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:13:11,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:13:11,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:13:11,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:13:11,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:13:11,590 INFO L87 Difference]: Start difference. First operand 15398 states and 24672 transitions. Second operand 3 states. [2019-09-08 10:13:12,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:13:12,958 INFO L93 Difference]: Finished difference Result 45779 states and 73299 transitions. [2019-09-08 10:13:12,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:13:12,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 481 [2019-09-08 10:13:12,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:13:13,026 INFO L225 Difference]: With dead ends: 45779 [2019-09-08 10:13:13,026 INFO L226 Difference]: Without dead ends: 30605 [2019-09-08 10:13:13,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 10:13:13,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30605 states. [2019-09-08 10:13:13,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30605 to 15515. [2019-09-08 10:13:13,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15515 states. [2019-09-08 10:13:13,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15515 states to 15515 states and 24818 transitions. [2019-09-08 10:13:13,847 INFO L78 Accepts]: Start accepts. Automaton has 15515 states and 24818 transitions. Word has length 481 [2019-09-08 10:13:13,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:13:13,847 INFO L475 AbstractCegarLoop]: Abstraction has 15515 states and 24818 transitions. [2019-09-08 10:13:13,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:13:13,847 INFO L276 IsEmpty]: Start isEmpty. Operand 15515 states and 24818 transitions. [2019-09-08 10:13:13,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2019-09-08 10:13:13,874 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:13:13,875 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:13:13,875 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:13:13,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:13:13,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1332057297, now seen corresponding path program 1 times [2019-09-08 10:13:13,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:13:13,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:13:13,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:13,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:13:13,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:14,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:13:14,781 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 10:13:14,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:13:14,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:13:14,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:13:14,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:13:14,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:13:14,785 INFO L87 Difference]: Start difference. First operand 15515 states and 24818 transitions. Second operand 4 states. [2019-09-08 10:13:16,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:13:16,115 INFO L93 Difference]: Finished difference Result 44486 states and 70868 transitions. [2019-09-08 10:13:16,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:13:16,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 482 [2019-09-08 10:13:16,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:13:16,191 INFO L225 Difference]: With dead ends: 44486 [2019-09-08 10:13:16,191 INFO L226 Difference]: Without dead ends: 30388 [2019-09-08 10:13:16,226 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 10:13:16,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30388 states. [2019-09-08 10:13:17,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30388 to 16450. [2019-09-08 10:13:17,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16450 states. [2019-09-08 10:13:17,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16450 states to 16450 states and 26466 transitions. [2019-09-08 10:13:17,441 INFO L78 Accepts]: Start accepts. Automaton has 16450 states and 26466 transitions. Word has length 482 [2019-09-08 10:13:17,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:13:17,441 INFO L475 AbstractCegarLoop]: Abstraction has 16450 states and 26466 transitions. [2019-09-08 10:13:17,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:13:17,441 INFO L276 IsEmpty]: Start isEmpty. Operand 16450 states and 26466 transitions. [2019-09-08 10:13:17,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2019-09-08 10:13:17,459 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:13:17,460 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:13:17,460 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:13:17,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:13:17,461 INFO L82 PathProgramCache]: Analyzing trace with hash 2119318772, now seen corresponding path program 1 times [2019-09-08 10:13:17,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:13:17,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:13:17,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:17,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:13:17,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:17,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:13:17,949 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 10:13:17,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:13:17,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:13:17,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:13:17,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:13:17,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:13:17,951 INFO L87 Difference]: Start difference. First operand 16450 states and 26466 transitions. Second operand 3 states. [2019-09-08 10:13:19,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:13:19,948 INFO L93 Difference]: Finished difference Result 46371 states and 74285 transitions. [2019-09-08 10:13:19,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:13:19,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 482 [2019-09-08 10:13:19,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:13:19,993 INFO L225 Difference]: With dead ends: 46371 [2019-09-08 10:13:19,993 INFO L226 Difference]: Without dead ends: 31481 [2019-09-08 10:13:20,015 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 10:13:20,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31481 states. [2019-09-08 10:13:21,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31481 to 31479. [2019-09-08 10:13:21,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31479 states. [2019-09-08 10:13:21,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31479 states to 31479 states and 50338 transitions. [2019-09-08 10:13:21,292 INFO L78 Accepts]: Start accepts. Automaton has 31479 states and 50338 transitions. Word has length 482 [2019-09-08 10:13:21,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:13:21,293 INFO L475 AbstractCegarLoop]: Abstraction has 31479 states and 50338 transitions. [2019-09-08 10:13:21,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:13:21,293 INFO L276 IsEmpty]: Start isEmpty. Operand 31479 states and 50338 transitions. [2019-09-08 10:13:21,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2019-09-08 10:13:21,332 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:13:21,332 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:13:21,333 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:13:21,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:13:21,333 INFO L82 PathProgramCache]: Analyzing trace with hash -668491437, now seen corresponding path program 1 times [2019-09-08 10:13:21,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:13:21,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:13:21,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:21,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:13:21,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:21,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:13:21,851 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 10:13:21,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:13:21,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:13:21,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:13:21,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:13:21,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:13:21,853 INFO L87 Difference]: Start difference. First operand 31479 states and 50338 transitions. Second operand 3 states. [2019-09-08 10:13:23,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:13:23,998 INFO L93 Difference]: Finished difference Result 87406 states and 138511 transitions. [2019-09-08 10:13:23,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:13:23,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 485 [2019-09-08 10:13:23,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:13:24,063 INFO L225 Difference]: With dead ends: 87406 [2019-09-08 10:13:24,063 INFO L226 Difference]: Without dead ends: 59480 [2019-09-08 10:13:24,100 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 10:13:24,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59480 states. [2019-09-08 10:13:25,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59480 to 31926. [2019-09-08 10:13:25,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31926 states. [2019-09-08 10:13:25,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31926 states to 31926 states and 51013 transitions. [2019-09-08 10:13:25,447 INFO L78 Accepts]: Start accepts. Automaton has 31926 states and 51013 transitions. Word has length 485 [2019-09-08 10:13:25,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:13:25,447 INFO L475 AbstractCegarLoop]: Abstraction has 31926 states and 51013 transitions. [2019-09-08 10:13:25,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:13:25,447 INFO L276 IsEmpty]: Start isEmpty. Operand 31926 states and 51013 transitions. [2019-09-08 10:13:25,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2019-09-08 10:13:25,482 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:13:25,482 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:13:25,482 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:13:25,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:13:25,483 INFO L82 PathProgramCache]: Analyzing trace with hash -454285750, now seen corresponding path program 1 times [2019-09-08 10:13:25,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:13:25,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:13:25,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:25,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:13:25,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:25,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:13:25,955 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 10:13:25,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:13:25,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:13:25,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:13:25,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:13:25,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:13:25,957 INFO L87 Difference]: Start difference. First operand 31926 states and 51013 transitions. Second operand 3 states. [2019-09-08 10:13:28,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:13:28,973 INFO L93 Difference]: Finished difference Result 88135 states and 139560 transitions. [2019-09-08 10:13:28,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:13:28,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 486 [2019-09-08 10:13:28,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:13:29,033 INFO L225 Difference]: With dead ends: 88135 [2019-09-08 10:13:29,033 INFO L226 Difference]: Without dead ends: 60095 [2019-09-08 10:13:29,066 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 10:13:29,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60095 states. [2019-09-08 10:13:30,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60095 to 32573. [2019-09-08 10:13:30,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32573 states. [2019-09-08 10:13:30,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32573 states to 32573 states and 51953 transitions. [2019-09-08 10:13:30,520 INFO L78 Accepts]: Start accepts. Automaton has 32573 states and 51953 transitions. Word has length 486 [2019-09-08 10:13:30,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:13:30,521 INFO L475 AbstractCegarLoop]: Abstraction has 32573 states and 51953 transitions. [2019-09-08 10:13:30,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:13:30,521 INFO L276 IsEmpty]: Start isEmpty. Operand 32573 states and 51953 transitions. [2019-09-08 10:13:30,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2019-09-08 10:13:30,559 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:13:30,559 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:13:30,560 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:13:30,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:13:30,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1125221313, now seen corresponding path program 1 times [2019-09-08 10:13:30,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:13:30,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:13:30,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:30,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:13:30,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:30,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:13:30,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 10:13:30,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:13:30,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:13:30,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:13:30,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:13:30,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:13:30,845 INFO L87 Difference]: Start difference. First operand 32573 states and 51953 transitions. Second operand 3 states. [2019-09-08 10:13:33,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:13:33,499 INFO L93 Difference]: Finished difference Result 89047 states and 140744 transitions. [2019-09-08 10:13:33,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:13:33,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 487 [2019-09-08 10:13:33,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:13:33,563 INFO L225 Difference]: With dead ends: 89047 [2019-09-08 10:13:33,563 INFO L226 Difference]: Without dead ends: 60949 [2019-09-08 10:13:33,607 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 10:13:33,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60949 states. [2019-09-08 10:13:35,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60949 to 33427. [2019-09-08 10:13:35,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33427 states. [2019-09-08 10:13:35,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33427 states to 33427 states and 53015 transitions. [2019-09-08 10:13:35,465 INFO L78 Accepts]: Start accepts. Automaton has 33427 states and 53015 transitions. Word has length 487 [2019-09-08 10:13:35,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:13:35,465 INFO L475 AbstractCegarLoop]: Abstraction has 33427 states and 53015 transitions. [2019-09-08 10:13:35,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:13:35,466 INFO L276 IsEmpty]: Start isEmpty. Operand 33427 states and 53015 transitions. [2019-09-08 10:13:35,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2019-09-08 10:13:35,491 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:13:35,491 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:13:35,491 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:13:35,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:13:35,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1133489197, now seen corresponding path program 1 times [2019-09-08 10:13:35,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:13:35,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:13:35,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:35,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:13:35,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:35,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:13:35,876 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 10:13:35,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:13:35,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:13:35,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:13:35,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:13:35,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:13:35,878 INFO L87 Difference]: Start difference. First operand 33427 states and 53015 transitions. Second operand 3 states. [2019-09-08 10:13:40,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:13:40,262 INFO L93 Difference]: Finished difference Result 75575 states and 117937 transitions. [2019-09-08 10:13:40,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:13:40,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 488 [2019-09-08 10:13:40,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:13:40,334 INFO L225 Difference]: With dead ends: 75575 [2019-09-08 10:13:40,334 INFO L226 Difference]: Without dead ends: 53821 [2019-09-08 10:13:40,370 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:13:40,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53821 states. [2019-09-08 10:13:43,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53821 to 53819. [2019-09-08 10:13:43,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53819 states. [2019-09-08 10:13:43,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53819 states to 53819 states and 83983 transitions. [2019-09-08 10:13:43,082 INFO L78 Accepts]: Start accepts. Automaton has 53819 states and 83983 transitions. Word has length 488 [2019-09-08 10:13:43,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:13:43,083 INFO L475 AbstractCegarLoop]: Abstraction has 53819 states and 83983 transitions. [2019-09-08 10:13:43,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:13:43,083 INFO L276 IsEmpty]: Start isEmpty. Operand 53819 states and 83983 transitions. [2019-09-08 10:13:43,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2019-09-08 10:13:43,125 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:13:43,126 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:13:43,126 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:13:43,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:13:43,127 INFO L82 PathProgramCache]: Analyzing trace with hash -907527363, now seen corresponding path program 1 times [2019-09-08 10:13:43,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:13:43,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:13:43,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:43,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:13:43,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:43,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:13:44,443 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 10:13:44,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:13:44,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:13:44,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:13:44,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:13:44,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:13:44,446 INFO L87 Difference]: Start difference. First operand 53819 states and 83983 transitions. Second operand 4 states. [2019-09-08 10:13:51,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:13:51,212 INFO L93 Difference]: Finished difference Result 159071 states and 248236 transitions. [2019-09-08 10:13:51,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:13:51,213 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 488 [2019-09-08 10:13:51,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:13:51,335 INFO L225 Difference]: With dead ends: 159071 [2019-09-08 10:13:51,335 INFO L226 Difference]: Without dead ends: 105515 [2019-09-08 10:13:51,389 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 10:13:51,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105515 states. [2019-09-08 10:13:56,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105515 to 105513. [2019-09-08 10:13:56,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105513 states. [2019-09-08 10:13:57,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105513 states to 105513 states and 164027 transitions. [2019-09-08 10:13:57,023 INFO L78 Accepts]: Start accepts. Automaton has 105513 states and 164027 transitions. Word has length 488 [2019-09-08 10:13:57,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:13:57,023 INFO L475 AbstractCegarLoop]: Abstraction has 105513 states and 164027 transitions. [2019-09-08 10:13:57,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:13:57,023 INFO L276 IsEmpty]: Start isEmpty. Operand 105513 states and 164027 transitions. [2019-09-08 10:13:57,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2019-09-08 10:13:57,111 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:13:57,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:13:57,111 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:13:57,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:13:57,112 INFO L82 PathProgramCache]: Analyzing trace with hash -699201506, now seen corresponding path program 1 times [2019-09-08 10:13:57,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:13:57,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:13:57,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:57,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:13:57,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:57,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:13:57,582 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 10:13:57,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:13:57,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:13:57,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:13:57,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:13:57,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:13:57,584 INFO L87 Difference]: Start difference. First operand 105513 states and 164027 transitions. Second operand 3 states. [2019-09-08 10:14:09,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:14:09,584 INFO L93 Difference]: Finished difference Result 309003 states and 479136 transitions. [2019-09-08 10:14:09,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:14:09,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 490 [2019-09-08 10:14:09,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:14:09,831 INFO L225 Difference]: With dead ends: 309003 [2019-09-08 10:14:09,831 INFO L226 Difference]: Without dead ends: 207058 [2019-09-08 10:14:09,930 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 10:14:10,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207058 states. [2019-09-08 10:14:24,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207058 to 207056. [2019-09-08 10:14:24,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207056 states. [2019-09-08 10:14:24,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207056 states to 207056 states and 320157 transitions. [2019-09-08 10:14:24,752 INFO L78 Accepts]: Start accepts. Automaton has 207056 states and 320157 transitions. Word has length 490 [2019-09-08 10:14:24,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:14:24,752 INFO L475 AbstractCegarLoop]: Abstraction has 207056 states and 320157 transitions. [2019-09-08 10:14:24,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:14:24,753 INFO L276 IsEmpty]: Start isEmpty. Operand 207056 states and 320157 transitions. [2019-09-08 10:14:24,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2019-09-08 10:14:24,943 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:14:24,943 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:14:24,943 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:14:24,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:14:24,944 INFO L82 PathProgramCache]: Analyzing trace with hash 9730554, now seen corresponding path program 1 times [2019-09-08 10:14:24,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:14:24,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:14:24,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:24,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:14:24,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:24,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:14:25,898 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 10:14:25,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:14:25,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:14:25,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:14:25,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:14:25,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:14:25,900 INFO L87 Difference]: Start difference. First operand 207056 states and 320157 transitions. Second operand 3 states. [2019-09-08 10:14:50,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:14:50,272 INFO L93 Difference]: Finished difference Result 610872 states and 943337 transitions. [2019-09-08 10:14:50,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:14:50,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 490 [2019-09-08 10:14:50,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:14:51,420 INFO L225 Difference]: With dead ends: 610872 [2019-09-08 10:14:51,420 INFO L226 Difference]: Without dead ends: 407830 [2019-09-08 10:14:51,623 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 10:14:51,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407830 states. [2019-09-08 10:15:24,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407830 to 407828. [2019-09-08 10:15:24,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407828 states. [2019-09-08 10:15:25,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407828 states to 407828 states and 627703 transitions. [2019-09-08 10:15:25,121 INFO L78 Accepts]: Start accepts. Automaton has 407828 states and 627703 transitions. Word has length 490 [2019-09-08 10:15:25,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:15:25,122 INFO L475 AbstractCegarLoop]: Abstraction has 407828 states and 627703 transitions. [2019-09-08 10:15:25,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:15:25,122 INFO L276 IsEmpty]: Start isEmpty. Operand 407828 states and 627703 transitions. [2019-09-08 10:15:25,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2019-09-08 10:15:25,520 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:15:25,520 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:15:25,520 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:15:25,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:15:25,521 INFO L82 PathProgramCache]: Analyzing trace with hash 681267829, now seen corresponding path program 1 times [2019-09-08 10:15:25,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:15:25,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:15:25,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:25,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:15:25,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:25,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:15:26,085 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 10:15:26,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:15:26,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:15:26,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:15:26,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:15:26,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:15:26,087 INFO L87 Difference]: Start difference. First operand 407828 states and 627703 transitions. Second operand 3 states. [2019-09-08 10:16:24,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:16:24,500 INFO L93 Difference]: Finished difference Result 1198723 states and 1841502 transitions. [2019-09-08 10:16:24,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:16:24,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 492 [2019-09-08 10:16:24,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:16:25,650 INFO L225 Difference]: With dead ends: 1198723 [2019-09-08 10:16:25,650 INFO L226 Difference]: Without dead ends: 802571 [2019-09-08 10:16:25,995 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 10:16:26,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802571 states. [2019-09-08 10:17:45,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802571 to 802569. [2019-09-08 10:17:45,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802569 states. [2019-09-08 10:17:47,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802569 states to 802569 states and 1229042 transitions. [2019-09-08 10:17:47,284 INFO L78 Accepts]: Start accepts. Automaton has 802569 states and 1229042 transitions. Word has length 492 [2019-09-08 10:17:47,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:17:47,285 INFO L475 AbstractCegarLoop]: Abstraction has 802569 states and 1229042 transitions. [2019-09-08 10:17:47,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:17:47,285 INFO L276 IsEmpty]: Start isEmpty. Operand 802569 states and 1229042 transitions. [2019-09-08 10:17:48,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2019-09-08 10:17:48,110 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:17:48,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:17:48,111 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:17:48,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:17:48,111 INFO L82 PathProgramCache]: Analyzing trace with hash 240481234, now seen corresponding path program 1 times [2019-09-08 10:17:48,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:17:48,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:17:48,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:17:48,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:17:48,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:17:48,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:17:50,588 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 10:17:50,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:17:50,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:17:50,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:17:50,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:17:50,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:17:50,591 INFO L87 Difference]: Start difference. First operand 802569 states and 1229042 transitions. Second operand 4 states. [2019-09-08 10:19:59,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:19:59,279 INFO L93 Difference]: Finished difference Result 2269031 states and 3464620 transitions. [2019-09-08 10:19:59,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:19:59,280 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 492 [2019-09-08 10:19:59,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:20:02,015 INFO L225 Difference]: With dead ends: 2269031 [2019-09-08 10:20:02,015 INFO L226 Difference]: Without dead ends: 1505765 [2019-09-08 10:20:02,634 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 10:20:03,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505765 states. [2019-09-08 10:21:39,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505765 to 816933. [2019-09-08 10:21:39,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 816933 states. [2019-09-08 10:21:41,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816933 states to 816933 states and 1254603 transitions. [2019-09-08 10:21:41,073 INFO L78 Accepts]: Start accepts. Automaton has 816933 states and 1254603 transitions. Word has length 492 [2019-09-08 10:21:41,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:21:41,073 INFO L475 AbstractCegarLoop]: Abstraction has 816933 states and 1254603 transitions. [2019-09-08 10:21:41,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:21:41,073 INFO L276 IsEmpty]: Start isEmpty. Operand 816933 states and 1254603 transitions. [2019-09-08 10:21:41,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2019-09-08 10:21:41,789 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:21:41,789 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:21:41,789 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:21:41,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:21:41,790 INFO L82 PathProgramCache]: Analyzing trace with hash -676001913, now seen corresponding path program 1 times [2019-09-08 10:21:41,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:21:41,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:21:41,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:21:41,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:21:41,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:21:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:21:43,389 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 10:21:43,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:21:43,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:21:43,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:21:43,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:21:43,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:21:43,391 INFO L87 Difference]: Start difference. First operand 816933 states and 1254603 transitions. Second operand 4 states.