java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 13:37:17,397 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 13:37:17,400 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 13:37:17,412 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 13:37:17,413 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 13:37:17,414 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 13:37:17,415 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 13:37:17,417 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 13:37:17,418 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 13:37:17,419 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 13:37:17,420 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 13:37:17,421 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 13:37:17,422 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 13:37:17,423 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 13:37:17,424 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 13:37:17,425 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 13:37:17,425 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 13:37:17,426 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 13:37:17,428 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 13:37:17,431 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 13:37:17,436 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 13:37:17,437 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 13:37:17,440 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 13:37:17,442 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 13:37:17,445 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 13:37:17,445 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 13:37:17,446 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 13:37:17,447 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 13:37:17,447 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 13:37:17,448 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 13:37:17,449 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 13:37:17,450 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 13:37:17,451 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 13:37:17,453 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 13:37:17,456 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 13:37:17,456 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 13:37:17,457 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 13:37:17,457 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 13:37:17,458 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 13:37:17,458 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 13:37:17,459 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 13:37:17,460 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 13:37:17,474 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 13:37:17,474 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 13:37:17,476 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 13:37:17,476 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 13:37:17,476 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 13:37:17,476 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 13:37:17,477 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 13:37:17,477 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 13:37:17,477 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 13:37:17,477 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 13:37:17,477 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 13:37:17,478 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 13:37:17,478 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 13:37:17,478 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 13:37:17,478 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 13:37:17,478 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 13:37:17,478 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 13:37:17,479 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 13:37:17,479 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 13:37:17,479 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 13:37:17,479 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 13:37:17,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:37:17,480 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 13:37:17,480 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 13:37:17,480 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 13:37:17,480 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 13:37:17,481 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 13:37:17,481 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 13:37:17,481 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 13:37:17,512 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 13:37:17,529 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 13:37:17,536 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 13:37:17,538 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 13:37:17,538 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 13:37:17,539 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 13:37:17,599 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fcd17f9c/7dfa70f690ee4dbf9a94e789b6902189/FLAG23d1f173a [2019-09-08 13:37:18,295 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 13:37:18,298 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 13:37:18,337 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fcd17f9c/7dfa70f690ee4dbf9a94e789b6902189/FLAG23d1f173a [2019-09-08 13:37:18,440 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fcd17f9c/7dfa70f690ee4dbf9a94e789b6902189 [2019-09-08 13:37:18,454 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 13:37:18,456 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 13:37:18,457 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 13:37:18,457 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 13:37:18,461 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 13:37:18,462 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:37:18" (1/1) ... [2019-09-08 13:37:18,466 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7594377c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:37:18, skipping insertion in model container [2019-09-08 13:37:18,466 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:37:18" (1/1) ... [2019-09-08 13:37:18,474 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 13:37:18,669 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 13:37:20,139 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:37:20,159 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 13:37:21,552 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:37:21,581 INFO L192 MainTranslator]: Completed translation [2019-09-08 13:37:21,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:37:21 WrapperNode [2019-09-08 13:37:21,582 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 13:37:21,583 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 13:37:21,583 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 13:37:21,584 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 13:37:21,605 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:37:21" (1/1) ... [2019-09-08 13:37:21,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:37:21" (1/1) ... [2019-09-08 13:37:21,681 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:37:21" (1/1) ... [2019-09-08 13:37:21,681 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:37:21" (1/1) ... [2019-09-08 13:37:21,751 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:37:21" (1/1) ... [2019-09-08 13:37:21,813 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:37:21" (1/1) ... [2019-09-08 13:37:21,845 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:37:21" (1/1) ... [2019-09-08 13:37:21,880 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 13:37:21,881 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 13:37:21,882 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 13:37:21,882 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 13:37:21,883 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:37:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:37:21,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 13:37:21,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 13:37:21,981 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 13:37:21,982 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 13:37:21,983 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 13:37:21,983 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 13:37:21,984 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 13:37:21,984 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 13:37:21,984 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 13:37:21,985 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 13:37:21,985 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 13:37:21,986 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 13:37:21,986 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 13:37:21,987 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 13:37:21,988 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 13:37:21,988 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 13:37:21,991 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 13:37:21,992 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 13:37:21,992 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 13:37:21,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 13:37:21,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 13:37:26,938 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 13:37:26,939 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 13:37:26,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:37:26 BoogieIcfgContainer [2019-09-08 13:37:26,942 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 13:37:26,943 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 13:37:26,943 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 13:37:26,947 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 13:37:26,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:37:18" (1/3) ... [2019-09-08 13:37:26,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78d080bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:37:26, skipping insertion in model container [2019-09-08 13:37:26,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:37:21" (2/3) ... [2019-09-08 13:37:26,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78d080bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:37:26, skipping insertion in model container [2019-09-08 13:37:26,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:37:26" (3/3) ... [2019-09-08 13:37:26,955 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.5.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 13:37:26,965 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 13:37:26,997 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 13:37:27,019 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 13:37:27,073 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 13:37:27,073 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 13:37:27,073 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 13:37:27,074 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 13:37:27,074 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 13:37:27,074 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 13:37:27,074 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 13:37:27,074 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 13:37:27,074 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 13:37:27,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states. [2019-09-08 13:37:27,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2019-09-08 13:37:27,190 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:37:27,192 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 13:37:27,195 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:37:27,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:37:27,203 INFO L82 PathProgramCache]: Analyzing trace with hash -710660715, now seen corresponding path program 1 times [2019-09-08 13:37:27,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:37:27,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:37:27,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:27,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:37:27,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:27,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:37:28,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:37:28,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:37:28,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:37:28,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:37:28,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:37:28,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:28,622 INFO L87 Difference]: Start difference. First operand 1449 states. Second operand 3 states. [2019-09-08 13:37:29,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:37:29,136 INFO L93 Difference]: Finished difference Result 2488 states and 4423 transitions. [2019-09-08 13:37:29,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:37:29,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 496 [2019-09-08 13:37:29,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:37:29,190 INFO L225 Difference]: With dead ends: 2488 [2019-09-08 13:37:29,190 INFO L226 Difference]: Without dead ends: 2186 [2019-09-08 13:37:29,198 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:29,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2186 states. [2019-09-08 13:37:29,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2186 to 2184. [2019-09-08 13:37:29,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2184 states. [2019-09-08 13:37:29,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2184 states to 2184 states and 3563 transitions. [2019-09-08 13:37:29,409 INFO L78 Accepts]: Start accepts. Automaton has 2184 states and 3563 transitions. Word has length 496 [2019-09-08 13:37:29,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:37:29,413 INFO L475 AbstractCegarLoop]: Abstraction has 2184 states and 3563 transitions. [2019-09-08 13:37:29,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:37:29,414 INFO L276 IsEmpty]: Start isEmpty. Operand 2184 states and 3563 transitions. [2019-09-08 13:37:29,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2019-09-08 13:37:29,429 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:37:29,430 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 13:37:29,430 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:37:29,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:37:29,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1749636116, now seen corresponding path program 1 times [2019-09-08 13:37:29,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:37:29,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:37:29,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:29,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:37:29,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:37:31,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:37:31,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:37:31,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:37:31,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:37:31,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:37:31,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:37:31,420 INFO L87 Difference]: Start difference. First operand 2184 states and 3563 transitions. Second operand 4 states. [2019-09-08 13:37:31,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:37:31,801 INFO L93 Difference]: Finished difference Result 6476 states and 10564 transitions. [2019-09-08 13:37:31,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:37:31,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 496 [2019-09-08 13:37:31,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:37:31,827 INFO L225 Difference]: With dead ends: 6476 [2019-09-08 13:37:31,828 INFO L226 Difference]: Without dead ends: 4309 [2019-09-08 13:37:31,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:37:31,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4309 states. [2019-09-08 13:37:32,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4309 to 4307. [2019-09-08 13:37:32,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4307 states. [2019-09-08 13:37:32,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4307 states to 4307 states and 7000 transitions. [2019-09-08 13:37:32,041 INFO L78 Accepts]: Start accepts. Automaton has 4307 states and 7000 transitions. Word has length 496 [2019-09-08 13:37:32,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:37:32,042 INFO L475 AbstractCegarLoop]: Abstraction has 4307 states and 7000 transitions. [2019-09-08 13:37:32,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:37:32,042 INFO L276 IsEmpty]: Start isEmpty. Operand 4307 states and 7000 transitions. [2019-09-08 13:37:32,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2019-09-08 13:37:32,063 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:37:32,063 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, 1, 1] [2019-09-08 13:37:32,064 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:37:32,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:37:32,065 INFO L82 PathProgramCache]: Analyzing trace with hash 471797169, now seen corresponding path program 1 times [2019-09-08 13:37:32,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:37:32,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:37:32,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:32,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:37:32,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:32,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:37:33,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:37:33,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:37:33,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:37:33,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:37:33,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:37:33,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:33,040 INFO L87 Difference]: Start difference. First operand 4307 states and 7000 transitions. Second operand 3 states. [2019-09-08 13:37:33,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:37:33,472 INFO L93 Difference]: Finished difference Result 12605 states and 20441 transitions. [2019-09-08 13:37:33,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:37:33,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 498 [2019-09-08 13:37:33,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:37:33,520 INFO L225 Difference]: With dead ends: 12605 [2019-09-08 13:37:33,520 INFO L226 Difference]: Without dead ends: 8512 [2019-09-08 13:37:33,532 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:33,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8512 states. [2019-09-08 13:37:33,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8512 to 8510. [2019-09-08 13:37:33,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8510 states. [2019-09-08 13:37:33,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8510 states to 8510 states and 13785 transitions. [2019-09-08 13:37:33,949 INFO L78 Accepts]: Start accepts. Automaton has 8510 states and 13785 transitions. Word has length 498 [2019-09-08 13:37:33,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:37:33,950 INFO L475 AbstractCegarLoop]: Abstraction has 8510 states and 13785 transitions. [2019-09-08 13:37:33,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:37:33,950 INFO L276 IsEmpty]: Start isEmpty. Operand 8510 states and 13785 transitions. [2019-09-08 13:37:33,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2019-09-08 13:37:33,978 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:37:33,978 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, 1, 1, 1] [2019-09-08 13:37:33,979 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:37:33,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:37:33,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1263260306, now seen corresponding path program 1 times [2019-09-08 13:37:33,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:37:33,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:37:33,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:33,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:37:33,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:34,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:37:34,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:37:34,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:37:34,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:37:34,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:37:34,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:37:34,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:34,293 INFO L87 Difference]: Start difference. First operand 8510 states and 13785 transitions. Second operand 3 states. [2019-09-08 13:37:35,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:37:35,805 INFO L93 Difference]: Finished difference Result 25433 states and 41187 transitions. [2019-09-08 13:37:35,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:37:35,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 499 [2019-09-08 13:37:35,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:37:35,898 INFO L225 Difference]: With dead ends: 25433 [2019-09-08 13:37:35,898 INFO L226 Difference]: Without dead ends: 16975 [2019-09-08 13:37:35,923 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:35,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16975 states. [2019-09-08 13:37:36,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16975 to 8557. [2019-09-08 13:37:36,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8557 states. [2019-09-08 13:37:36,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8557 states to 8557 states and 13859 transitions. [2019-09-08 13:37:36,475 INFO L78 Accepts]: Start accepts. Automaton has 8557 states and 13859 transitions. Word has length 499 [2019-09-08 13:37:36,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:37:36,475 INFO L475 AbstractCegarLoop]: Abstraction has 8557 states and 13859 transitions. [2019-09-08 13:37:36,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:37:36,476 INFO L276 IsEmpty]: Start isEmpty. Operand 8557 states and 13859 transitions. [2019-09-08 13:37:36,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2019-09-08 13:37:36,512 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:37:36,512 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, 1, 1, 1, 1] [2019-09-08 13:37:36,513 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:37:36,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:37:36,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1263344305, now seen corresponding path program 1 times [2019-09-08 13:37:36,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:37:36,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:37:36,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:36,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:37:36,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:36,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:37:36,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:37:36,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:37:36,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:37:36,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:37:36,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:37:36,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:36,836 INFO L87 Difference]: Start difference. First operand 8557 states and 13859 transitions. Second operand 3 states. [2019-09-08 13:37:37,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:37:37,727 INFO L93 Difference]: Finished difference Result 25501 states and 41283 transitions. [2019-09-08 13:37:37,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:37:37,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 500 [2019-09-08 13:37:37,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:37:37,788 INFO L225 Difference]: With dead ends: 25501 [2019-09-08 13:37:37,788 INFO L226 Difference]: Without dead ends: 17038 [2019-09-08 13:37:37,813 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:37,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17038 states. [2019-09-08 13:37:38,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17038 to 8628. [2019-09-08 13:37:38,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8628 states. [2019-09-08 13:37:38,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8628 states to 8628 states and 13968 transitions. [2019-09-08 13:37:38,444 INFO L78 Accepts]: Start accepts. Automaton has 8628 states and 13968 transitions. Word has length 500 [2019-09-08 13:37:38,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:37:38,444 INFO L475 AbstractCegarLoop]: Abstraction has 8628 states and 13968 transitions. [2019-09-08 13:37:38,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:37:38,445 INFO L276 IsEmpty]: Start isEmpty. Operand 8628 states and 13968 transitions. [2019-09-08 13:37:38,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2019-09-08 13:37:38,467 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:37:38,467 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, 1, 1, 1, 1] [2019-09-08 13:37:38,468 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:37:38,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:37:38,468 INFO L82 PathProgramCache]: Analyzing trace with hash -210005332, now seen corresponding path program 1 times [2019-09-08 13:37:38,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:37:38,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:37:38,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:38,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:37:38,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:38,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:37:39,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:37:39,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:37:39,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:37:39,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:37:39,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:37:39,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:39,346 INFO L87 Difference]: Start difference. First operand 8628 states and 13968 transitions. Second operand 3 states. [2019-09-08 13:37:40,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:37:40,256 INFO L93 Difference]: Finished difference Result 25018 states and 40399 transitions. [2019-09-08 13:37:40,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:37:40,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 500 [2019-09-08 13:37:40,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:37:40,296 INFO L225 Difference]: With dead ends: 25018 [2019-09-08 13:37:40,296 INFO L226 Difference]: Without dead ends: 16860 [2019-09-08 13:37:40,319 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:40,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16860 states. [2019-09-08 13:37:41,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16860 to 16858. [2019-09-08 13:37:41,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16858 states. [2019-09-08 13:37:41,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16858 states to 16858 states and 27168 transitions. [2019-09-08 13:37:41,071 INFO L78 Accepts]: Start accepts. Automaton has 16858 states and 27168 transitions. Word has length 500 [2019-09-08 13:37:41,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:37:41,071 INFO L475 AbstractCegarLoop]: Abstraction has 16858 states and 27168 transitions. [2019-09-08 13:37:41,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:37:41,072 INFO L276 IsEmpty]: Start isEmpty. Operand 16858 states and 27168 transitions. [2019-09-08 13:37:41,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2019-09-08 13:37:41,108 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:37:41,109 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, 1, 1, 1, 1, 1] [2019-09-08 13:37:41,109 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:37:41,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:37:41,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1043556226, now seen corresponding path program 1 times [2019-09-08 13:37:41,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:37:41,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:37:41,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:41,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:37:41,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:41,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:37:41,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:37:41,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:37:41,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:37:41,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:37:41,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:37:41,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:41,694 INFO L87 Difference]: Start difference. First operand 16858 states and 27168 transitions. Second operand 3 states. [2019-09-08 13:37:43,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:37:43,047 INFO L93 Difference]: Finished difference Result 50159 states and 80787 transitions. [2019-09-08 13:37:43,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:37:43,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 501 [2019-09-08 13:37:43,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:37:43,126 INFO L225 Difference]: With dead ends: 50159 [2019-09-08 13:37:43,127 INFO L226 Difference]: Without dead ends: 33525 [2019-09-08 13:37:43,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:43,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33525 states. [2019-09-08 13:37:45,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33525 to 16975. [2019-09-08 13:37:45,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16975 states. [2019-09-08 13:37:45,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16975 states to 16975 states and 27314 transitions. [2019-09-08 13:37:45,106 INFO L78 Accepts]: Start accepts. Automaton has 16975 states and 27314 transitions. Word has length 501 [2019-09-08 13:37:45,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:37:45,107 INFO L475 AbstractCegarLoop]: Abstraction has 16975 states and 27314 transitions. [2019-09-08 13:37:45,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:37:45,107 INFO L276 IsEmpty]: Start isEmpty. Operand 16975 states and 27314 transitions. [2019-09-08 13:37:45,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2019-09-08 13:37:45,155 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:37:45,156 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, 1, 1, 1, 1, 1, 1] [2019-09-08 13:37:45,157 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:37:45,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:37:45,157 INFO L82 PathProgramCache]: Analyzing trace with hash 317954470, now seen corresponding path program 1 times [2019-09-08 13:37:45,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:37:45,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:37:45,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:45,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:37:45,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:45,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:37:45,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 13:37:45,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:37:45,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:37:45,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:37:45,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:37:45,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:45,591 INFO L87 Difference]: Start difference. First operand 16975 states and 27314 transitions. Second operand 3 states. [2019-09-08 13:37:46,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:37:46,794 INFO L93 Difference]: Finished difference Result 36907 states and 58972 transitions. [2019-09-08 13:37:46,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:37:46,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 502 [2019-09-08 13:37:46,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:37:46,847 INFO L225 Difference]: With dead ends: 36907 [2019-09-08 13:37:46,847 INFO L226 Difference]: Without dead ends: 24449 [2019-09-08 13:37:46,883 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:46,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24449 states. [2019-09-08 13:37:47,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24449 to 20175. [2019-09-08 13:37:47,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20175 states. [2019-09-08 13:37:47,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20175 states to 20175 states and 32638 transitions. [2019-09-08 13:37:47,909 INFO L78 Accepts]: Start accepts. Automaton has 20175 states and 32638 transitions. Word has length 502 [2019-09-08 13:37:47,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:37:47,910 INFO L475 AbstractCegarLoop]: Abstraction has 20175 states and 32638 transitions. [2019-09-08 13:37:47,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:37:47,910 INFO L276 IsEmpty]: Start isEmpty. Operand 20175 states and 32638 transitions. [2019-09-08 13:37:47,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2019-09-08 13:37:47,958 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:37:47,958 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, 1, 1, 1, 1, 1, 1] [2019-09-08 13:37:47,958 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:37:47,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:37:47,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1257605063, now seen corresponding path program 1 times [2019-09-08 13:37:47,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:37:47,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:37:47,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:47,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:37:47,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:48,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:37:48,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:37:48,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:37:48,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:37:48,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:37:48,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:37:48,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:48,455 INFO L87 Difference]: Start difference. First operand 20175 states and 32638 transitions. Second operand 3 states. [2019-09-08 13:37:50,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:37:50,187 INFO L93 Difference]: Finished difference Result 58562 states and 94581 transitions. [2019-09-08 13:37:50,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:37:50,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 502 [2019-09-08 13:37:50,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:37:50,259 INFO L225 Difference]: With dead ends: 58562 [2019-09-08 13:37:50,259 INFO L226 Difference]: Without dead ends: 39356 [2019-09-08 13:37:50,289 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:50,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39356 states. [2019-09-08 13:37:52,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39356 to 39354. [2019-09-08 13:37:52,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39354 states. [2019-09-08 13:37:52,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39354 states to 39354 states and 63395 transitions. [2019-09-08 13:37:52,158 INFO L78 Accepts]: Start accepts. Automaton has 39354 states and 63395 transitions. Word has length 502 [2019-09-08 13:37:52,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:37:52,159 INFO L475 AbstractCegarLoop]: Abstraction has 39354 states and 63395 transitions. [2019-09-08 13:37:52,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:37:52,159 INFO L276 IsEmpty]: Start isEmpty. Operand 39354 states and 63395 transitions. [2019-09-08 13:37:52,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2019-09-08 13:37:52,193 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:37:52,193 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, 1, 1, 1, 1, 1, 1] [2019-09-08 13:37:52,194 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:37:52,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:37:52,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1341960412, now seen corresponding path program 1 times [2019-09-08 13:37:52,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:37:52,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:37:52,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:52,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:37:52,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:52,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:37:53,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:37:53,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:37:53,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:37:53,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:37:53,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:37:53,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:37:53,031 INFO L87 Difference]: Start difference. First operand 39354 states and 63395 transitions. Second operand 4 states. [2019-09-08 13:37:56,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:37:56,402 INFO L93 Difference]: Finished difference Result 112288 states and 180360 transitions. [2019-09-08 13:37:56,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:37:56,406 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 502 [2019-09-08 13:37:56,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:37:56,520 INFO L225 Difference]: With dead ends: 112288 [2019-09-08 13:37:56,521 INFO L226 Difference]: Without dead ends: 75214 [2019-09-08 13:37:56,583 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:37:56,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75214 states. [2019-09-08 13:37:58,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75214 to 40647. [2019-09-08 13:37:58,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40647 states. [2019-09-08 13:37:58,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40647 states to 40647 states and 65674 transitions. [2019-09-08 13:37:58,451 INFO L78 Accepts]: Start accepts. Automaton has 40647 states and 65674 transitions. Word has length 502 [2019-09-08 13:37:58,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:37:58,451 INFO L475 AbstractCegarLoop]: Abstraction has 40647 states and 65674 transitions. [2019-09-08 13:37:58,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:37:58,451 INFO L276 IsEmpty]: Start isEmpty. Operand 40647 states and 65674 transitions. [2019-09-08 13:37:58,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2019-09-08 13:37:58,492 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:37:58,493 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:37:58,493 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:37:58,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:37:58,494 INFO L82 PathProgramCache]: Analyzing trace with hash 231276154, now seen corresponding path program 1 times [2019-09-08 13:37:58,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:37:58,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:37:58,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:58,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:37:58,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:58,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:37:58,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:37:58,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:37:58,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:37:58,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:37:58,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:37:58,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:58,868 INFO L87 Difference]: Start difference. First operand 40647 states and 65674 transitions. Second operand 3 states. [2019-09-08 13:38:01,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:38:01,337 INFO L93 Difference]: Finished difference Result 89043 states and 143284 transitions. [2019-09-08 13:38:01,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:38:01,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 504 [2019-09-08 13:38:01,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:38:01,406 INFO L225 Difference]: With dead ends: 89043 [2019-09-08 13:38:01,406 INFO L226 Difference]: Without dead ends: 58985 [2019-09-08 13:38:01,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:38:01,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58985 states. [2019-09-08 13:38:05,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58985 to 52071. [2019-09-08 13:38:05,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52071 states. [2019-09-08 13:38:05,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52071 states to 52071 states and 84594 transitions. [2019-09-08 13:38:05,120 INFO L78 Accepts]: Start accepts. Automaton has 52071 states and 84594 transitions. Word has length 504 [2019-09-08 13:38:05,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:38:05,121 INFO L475 AbstractCegarLoop]: Abstraction has 52071 states and 84594 transitions. [2019-09-08 13:38:05,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:38:05,121 INFO L276 IsEmpty]: Start isEmpty. Operand 52071 states and 84594 transitions. [2019-09-08 13:38:05,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2019-09-08 13:38:05,157 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:38:05,157 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:38:05,157 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:38:05,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:38:05,158 INFO L82 PathProgramCache]: Analyzing trace with hash 863061750, now seen corresponding path program 1 times [2019-09-08 13:38:05,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:38:05,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:38:05,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:38:05,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:38:05,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:38:05,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:38:06,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:38:06,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:38:06,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 13:38:06,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 13:38:06,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 13:38:06,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:38:06,262 INFO L87 Difference]: Start difference. First operand 52071 states and 84594 transitions. Second operand 9 states. [2019-09-08 13:38:14,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:38:14,910 INFO L93 Difference]: Finished difference Result 155827 states and 252482 transitions. [2019-09-08 13:38:14,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 13:38:14,910 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 505 [2019-09-08 13:38:14,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:38:15,054 INFO L225 Difference]: With dead ends: 155827 [2019-09-08 13:38:15,054 INFO L226 Difference]: Without dead ends: 113881 [2019-09-08 13:38:15,099 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-09-08 13:38:15,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113881 states. [2019-09-08 13:38:20,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113881 to 64663. [2019-09-08 13:38:20,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64663 states. [2019-09-08 13:38:20,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64663 states to 64663 states and 103282 transitions. [2019-09-08 13:38:20,268 INFO L78 Accepts]: Start accepts. Automaton has 64663 states and 103282 transitions. Word has length 505 [2019-09-08 13:38:20,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:38:20,269 INFO L475 AbstractCegarLoop]: Abstraction has 64663 states and 103282 transitions. [2019-09-08 13:38:20,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 13:38:20,269 INFO L276 IsEmpty]: Start isEmpty. Operand 64663 states and 103282 transitions. [2019-09-08 13:38:20,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2019-09-08 13:38:20,304 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:38:20,304 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:38:20,305 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:38:20,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:38:20,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1740791442, now seen corresponding path program 1 times [2019-09-08 13:38:20,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:38:20,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:38:20,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:38:20,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:38:20,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:38:21,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:38:22,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:38:22,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:38:22,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:38:22,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:38:22,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:38:22,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:38:22,094 INFO L87 Difference]: Start difference. First operand 64663 states and 103282 transitions. Second operand 4 states. [2019-09-08 13:38:30,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:38:30,318 INFO L93 Difference]: Finished difference Result 191102 states and 305261 transitions. [2019-09-08 13:38:30,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:38:30,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 505 [2019-09-08 13:38:30,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:38:30,486 INFO L225 Difference]: With dead ends: 191102 [2019-09-08 13:38:30,486 INFO L226 Difference]: Without dead ends: 126702 [2019-09-08 13:38:30,557 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:38:30,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126702 states. [2019-09-08 13:38:37,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126702 to 126700. [2019-09-08 13:38:37,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126700 states. [2019-09-08 13:38:37,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126700 states to 126700 states and 201753 transitions. [2019-09-08 13:38:37,446 INFO L78 Accepts]: Start accepts. Automaton has 126700 states and 201753 transitions. Word has length 505 [2019-09-08 13:38:37,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:38:37,447 INFO L475 AbstractCegarLoop]: Abstraction has 126700 states and 201753 transitions. [2019-09-08 13:38:37,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:38:37,447 INFO L276 IsEmpty]: Start isEmpty. Operand 126700 states and 201753 transitions. [2019-09-08 13:38:37,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2019-09-08 13:38:37,508 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:38:37,508 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:38:37,509 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:38:37,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:38:37,509 INFO L82 PathProgramCache]: Analyzing trace with hash -282622487, now seen corresponding path program 1 times [2019-09-08 13:38:37,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:38:37,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:38:37,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:38:37,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:38:37,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:38:37,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:38:38,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:38:38,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:38:38,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:38:38,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:38:38,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:38:38,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:38:38,439 INFO L87 Difference]: Start difference. First operand 126700 states and 201753 transitions. Second operand 3 states. [2019-09-08 13:38:53,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:38:53,173 INFO L93 Difference]: Finished difference Result 371764 states and 591450 transitions. [2019-09-08 13:38:53,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:38:53,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 507 [2019-09-08 13:38:53,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:38:53,506 INFO L225 Difference]: With dead ends: 371764 [2019-09-08 13:38:53,506 INFO L226 Difference]: Without dead ends: 248632 [2019-09-08 13:38:53,608 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:38:53,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248632 states. [2019-09-08 13:39:14,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248632 to 248630. [2019-09-08 13:39:14,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248630 states. [2019-09-08 13:39:14,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248630 states to 248630 states and 394848 transitions. [2019-09-08 13:39:14,428 INFO L78 Accepts]: Start accepts. Automaton has 248630 states and 394848 transitions. Word has length 507 [2019-09-08 13:39:14,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:39:14,429 INFO L475 AbstractCegarLoop]: Abstraction has 248630 states and 394848 transitions. [2019-09-08 13:39:14,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:39:14,429 INFO L276 IsEmpty]: Start isEmpty. Operand 248630 states and 394848 transitions. [2019-09-08 13:39:14,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2019-09-08 13:39:14,551 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:39:14,551 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:39:14,551 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:39:14,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:39:14,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1383274173, now seen corresponding path program 1 times [2019-09-08 13:39:14,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:39:14,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:39:14,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:14,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:39:14,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:14,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:39:14,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:39:14,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:39:14,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:39:14,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:39:14,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:39:14,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:39:14,835 INFO L87 Difference]: Start difference. First operand 248630 states and 394848 transitions. Second operand 3 states. [2019-09-08 13:39:45,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:39:45,492 INFO L93 Difference]: Finished difference Result 725204 states and 1147764 transitions. [2019-09-08 13:39:45,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:39:45,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 507 [2019-09-08 13:39:45,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:39:46,174 INFO L225 Difference]: With dead ends: 725204 [2019-09-08 13:39:46,174 INFO L226 Difference]: Without dead ends: 487066 [2019-09-08 13:39:46,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:39:46,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487066 states. [2019-09-08 13:40:11,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487066 to 250392. [2019-09-08 13:40:11,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250392 states. [2019-09-08 13:40:11,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250392 states to 250392 states and 397506 transitions. [2019-09-08 13:40:11,688 INFO L78 Accepts]: Start accepts. Automaton has 250392 states and 397506 transitions. Word has length 507 [2019-09-08 13:40:11,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:40:11,689 INFO L475 AbstractCegarLoop]: Abstraction has 250392 states and 397506 transitions. [2019-09-08 13:40:11,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:40:11,689 INFO L276 IsEmpty]: Start isEmpty. Operand 250392 states and 397506 transitions. [2019-09-08 13:40:11,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2019-09-08 13:40:11,821 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:40:11,822 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:40:11,822 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:40:11,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:40:11,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1187686741, now seen corresponding path program 1 times [2019-09-08 13:40:11,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:40:11,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:40:11,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:11,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:40:11,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:11,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:40:16,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:40:16,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:40:16,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:40:16,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:40:16,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:40:16,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:40:16,245 INFO L87 Difference]: Start difference. First operand 250392 states and 397506 transitions. Second operand 3 states. [2019-09-08 13:40:41,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:40:41,478 INFO L93 Difference]: Finished difference Result 601948 states and 956356 transitions. [2019-09-08 13:40:41,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:40:41,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 508 [2019-09-08 13:40:41,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:40:42,047 INFO L225 Difference]: With dead ends: 601948 [2019-09-08 13:40:42,047 INFO L226 Difference]: Without dead ends: 393178 [2019-09-08 13:40:42,240 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:40:42,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393178 states. [2019-09-08 13:41:12,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393178 to 357656. [2019-09-08 13:41:12,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357656 states. [2019-09-08 13:41:13,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357656 states to 357656 states and 570114 transitions. [2019-09-08 13:41:13,555 INFO L78 Accepts]: Start accepts. Automaton has 357656 states and 570114 transitions. Word has length 508 [2019-09-08 13:41:13,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:41:13,556 INFO L475 AbstractCegarLoop]: Abstraction has 357656 states and 570114 transitions. [2019-09-08 13:41:13,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:41:13,556 INFO L276 IsEmpty]: Start isEmpty. Operand 357656 states and 570114 transitions. [2019-09-08 13:41:13,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2019-09-08 13:41:13,687 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:41:13,688 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:41:13,688 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:41:13,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:41:13,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1188042342, now seen corresponding path program 1 times [2019-09-08 13:41:13,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:41:13,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:41:13,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:41:13,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:41:13,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:41:13,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:41:13,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:41:13,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:41:13,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:41:13,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:41:13,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:41:13,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:41:13,947 INFO L87 Difference]: Start difference. First operand 357656 states and 570114 transitions. Second operand 3 states. [2019-09-08 13:42:07,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:42:07,175 INFO L93 Difference]: Finished difference Result 1049870 states and 1669687 transitions. [2019-09-08 13:42:07,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:42:07,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 508 [2019-09-08 13:42:07,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:42:08,267 INFO L225 Difference]: With dead ends: 1049870 [2019-09-08 13:42:08,267 INFO L226 Difference]: Without dead ends: 704016 [2019-09-08 13:42:08,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:42:09,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704016 states. [2019-09-08 13:42:55,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704016 to 360206. [2019-09-08 13:42:55,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360206 states. [2019-09-08 13:42:55,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360206 states to 360206 states and 573783 transitions. [2019-09-08 13:42:55,629 INFO L78 Accepts]: Start accepts. Automaton has 360206 states and 573783 transitions. Word has length 508 [2019-09-08 13:42:55,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:42:55,629 INFO L475 AbstractCegarLoop]: Abstraction has 360206 states and 573783 transitions. [2019-09-08 13:42:55,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:42:55,630 INFO L276 IsEmpty]: Start isEmpty. Operand 360206 states and 573783 transitions. [2019-09-08 13:42:56,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2019-09-08 13:42:56,609 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:42:56,610 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:42:56,610 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:42:56,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:42:56,610 INFO L82 PathProgramCache]: Analyzing trace with hash 24858990, now seen corresponding path program 1 times [2019-09-08 13:42:56,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:42:56,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:42:56,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:42:56,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:42:56,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:42:56,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:42:57,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:42:57,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:42:57,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:42:57,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:42:57,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:42:57,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:42:57,043 INFO L87 Difference]: Start difference. First operand 360206 states and 573783 transitions. Second operand 3 states. [2019-09-08 13:43:53,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:43:53,565 INFO L93 Difference]: Finished difference Result 1067692 states and 1700177 transitions. [2019-09-08 13:43:53,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:43:53,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 509 [2019-09-08 13:43:53,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:43:54,678 INFO L225 Difference]: With dead ends: 1067692 [2019-09-08 13:43:54,678 INFO L226 Difference]: Without dead ends: 711500 [2019-09-08 13:43:54,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:43:55,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711500 states. [2019-09-08 13:45:05,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711500 to 711498. [2019-09-08 13:45:05,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 711498 states. [2019-09-08 13:45:15,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711498 states to 711498 states and 1129695 transitions. [2019-09-08 13:45:15,980 INFO L78 Accepts]: Start accepts. Automaton has 711498 states and 1129695 transitions. Word has length 509 [2019-09-08 13:45:15,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:45:15,980 INFO L475 AbstractCegarLoop]: Abstraction has 711498 states and 1129695 transitions. [2019-09-08 13:45:15,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:45:15,981 INFO L276 IsEmpty]: Start isEmpty. Operand 711498 states and 1129695 transitions. [2019-09-08 13:45:16,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2019-09-08 13:45:16,289 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:45:16,289 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:45:16,289 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:45:16,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:45:16,290 INFO L82 PathProgramCache]: Analyzing trace with hash 782799059, now seen corresponding path program 1 times [2019-09-08 13:45:16,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:45:16,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:45:16,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:45:16,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:45:16,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:45:16,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:45:16,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:45:16,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:45:16,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:45:16,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:45:16,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:45:16,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:45:16,706 INFO L87 Difference]: Start difference. First operand 711498 states and 1129695 transitions. Second operand 3 states. [2019-09-08 13:47:22,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:47:22,493 INFO L93 Difference]: Finished difference Result 2100032 states and 3330975 transitions. [2019-09-08 13:47:22,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:47:22,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 511 [2019-09-08 13:47:22,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:47:24,966 INFO L225 Difference]: With dead ends: 2100032 [2019-09-08 13:47:24,966 INFO L226 Difference]: Without dead ends: 1399671 [2019-09-08 13:47:25,617 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:47:26,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399671 states.