java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 10:06:44,669 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 10:06:44,671 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 10:06:44,682 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 10:06:44,682 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 10:06:44,683 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 10:06:44,685 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 10:06:44,687 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 10:06:44,688 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 10:06:44,689 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 10:06:44,690 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 10:06:44,691 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 10:06:44,691 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 10:06:44,692 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 10:06:44,693 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 10:06:44,694 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 10:06:44,695 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 10:06:44,696 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 10:06:44,698 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 10:06:44,699 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 10:06:44,701 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 10:06:44,702 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 10:06:44,703 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 10:06:44,704 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 10:06:44,706 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 10:06:44,706 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 10:06:44,707 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 10:06:44,707 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 10:06:44,708 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 10:06:44,709 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 10:06:44,709 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 10:06:44,710 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 10:06:44,711 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 10:06:44,711 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 10:06:44,712 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 10:06:44,713 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 10:06:44,713 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 10:06:44,713 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 10:06:44,714 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 10:06:44,715 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 10:06:44,715 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 10:06:44,716 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 10:06:44,731 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 10:06:44,731 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 10:06:44,732 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 10:06:44,732 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 10:06:44,732 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 10:06:44,733 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 10:06:44,733 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 10:06:44,733 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 10:06:44,733 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 10:06:44,733 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 10:06:44,734 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 10:06:44,734 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 10:06:44,734 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 10:06:44,734 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 10:06:44,734 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 10:06:44,735 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 10:06:44,735 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 10:06:44,735 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 10:06:44,735 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 10:06:44,735 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 10:06:44,736 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 10:06:44,736 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:06:44,736 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 10:06:44,736 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 10:06:44,736 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 10:06:44,737 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 10:06:44,737 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 10:06:44,737 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 10:06:44,737 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 10:06:44,765 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 10:06:44,778 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 10:06:44,781 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 10:06:44,783 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 10:06:44,783 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 10:06:44,784 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2019-09-08 10:06:44,842 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/960463092/bd8d8cd0ee5940ee8fd7ea740f31db22/FLAGb09b97766 [2019-09-08 10:06:45,516 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 10:06:45,517 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2019-09-08 10:06:45,553 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/960463092/bd8d8cd0ee5940ee8fd7ea740f31db22/FLAGb09b97766 [2019-09-08 10:06:45,669 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/960463092/bd8d8cd0ee5940ee8fd7ea740f31db22 [2019-09-08 10:06:45,680 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 10:06:45,681 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 10:06:45,682 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 10:06:45,682 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 10:06:45,686 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 10:06:45,687 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:06:45" (1/1) ... [2019-09-08 10:06:45,690 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7669911c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:06:45, skipping insertion in model container [2019-09-08 10:06:45,690 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:06:45" (1/1) ... [2019-09-08 10:06:45,698 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 10:06:45,901 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 10:06:47,364 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:06:47,380 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 10:06:48,924 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:06:48,968 INFO L192 MainTranslator]: Completed translation [2019-09-08 10:06:48,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:06:48 WrapperNode [2019-09-08 10:06:48,969 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 10:06:48,970 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 10:06:48,971 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 10:06:48,971 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 10:06:48,988 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:06:48" (1/1) ... [2019-09-08 10:06:48,988 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:06:48" (1/1) ... [2019-09-08 10:06:49,044 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:06:48" (1/1) ... [2019-09-08 10:06:49,044 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:06:48" (1/1) ... [2019-09-08 10:06:49,107 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:06:48" (1/1) ... [2019-09-08 10:06:49,150 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:06:48" (1/1) ... [2019-09-08 10:06:49,170 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:06:48" (1/1) ... [2019-09-08 10:06:49,194 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 10:06:49,195 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 10:06:49,195 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 10:06:49,196 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 10:06:49,197 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:06:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:06:49,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 10:06:49,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 10:06:49,267 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 10:06:49,267 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 10:06:49,268 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 10:06:49,269 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 10:06:49,269 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 10:06:49,269 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 10:06:49,270 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 10:06:49,270 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 10:06:49,270 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 10:06:49,271 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 10:06:49,271 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 10:06:49,272 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 10:06:49,272 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 10:06:49,273 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 10:06:49,275 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 10:06:49,276 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 10:06:49,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 10:06:49,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 10:06:53,378 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 10:06:53,379 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 10:06:53,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:06:53 BoogieIcfgContainer [2019-09-08 10:06:53,381 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 10:06:53,382 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 10:06:53,382 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 10:06:53,385 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 10:06:53,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:06:45" (1/3) ... [2019-09-08 10:06:53,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bdb5326 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:06:53, skipping insertion in model container [2019-09-08 10:06:53,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:06:48" (2/3) ... [2019-09-08 10:06:53,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bdb5326 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:06:53, skipping insertion in model container [2019-09-08 10:06:53,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:06:53" (3/3) ... [2019-09-08 10:06:53,389 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2019-09-08 10:06:53,398 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 10:06:53,407 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-09-08 10:06:53,425 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-09-08 10:06:53,462 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 10:06:53,463 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 10:06:53,463 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 10:06:53,464 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 10:06:53,464 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 10:06:53,464 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 10:06:53,464 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 10:06:53,464 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 10:06:53,464 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 10:06:53,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states. [2019-09-08 10:06:53,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2019-09-08 10:06:53,540 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:06:53,541 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] [2019-09-08 10:06:53,544 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:06:53,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:06:53,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1628601858, now seen corresponding path program 1 times [2019-09-08 10:06:53,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:06:53,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:06:53,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:06:53,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:06:53,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:06:55,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:06:56,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:06:56,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:06:56,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:06:56,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:06:56,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:06:56,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:06:56,123 INFO L87 Difference]: Start difference. First operand 1371 states. Second operand 4 states. [2019-09-08 10:06:56,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:06:56,736 INFO L93 Difference]: Finished difference Result 4059 states and 7350 transitions. [2019-09-08 10:06:56,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:06:56,739 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 464 [2019-09-08 10:06:56,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:06:56,790 INFO L225 Difference]: With dead ends: 4059 [2019-09-08 10:06:56,790 INFO L226 Difference]: Without dead ends: 2697 [2019-09-08 10:06:56,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:06:56,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-08 10:06:57,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 2647. [2019-09-08 10:06:57,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2647 states. [2019-09-08 10:06:57,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2647 states to 2647 states and 4347 transitions. [2019-09-08 10:06:57,066 INFO L78 Accepts]: Start accepts. Automaton has 2647 states and 4347 transitions. Word has length 464 [2019-09-08 10:06:57,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:06:57,068 INFO L475 AbstractCegarLoop]: Abstraction has 2647 states and 4347 transitions. [2019-09-08 10:06:57,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:06:57,068 INFO L276 IsEmpty]: Start isEmpty. Operand 2647 states and 4347 transitions. [2019-09-08 10:06:57,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2019-09-08 10:06:57,094 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:06:57,095 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] [2019-09-08 10:06:57,095 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:06:57,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:06:57,096 INFO L82 PathProgramCache]: Analyzing trace with hash -283070934, now seen corresponding path program 1 times [2019-09-08 10:06:57,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:06:57,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:06:57,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:06:57,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:06:57,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:06:57,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:06:57,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:06:57,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:06:57,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:06:57,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:06:57,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:06:57,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:06:57,817 INFO L87 Difference]: Start difference. First operand 2647 states and 4347 transitions. Second operand 3 states. [2019-09-08 10:06:58,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:06:58,356 INFO L93 Difference]: Finished difference Result 7670 states and 12560 transitions. [2019-09-08 10:06:58,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:06:58,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 466 [2019-09-08 10:06:58,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:06:58,399 INFO L225 Difference]: With dead ends: 7670 [2019-09-08 10:06:58,399 INFO L226 Difference]: Without dead ends: 5237 [2019-09-08 10:06:58,409 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:06:58,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5237 states. [2019-09-08 10:06:58,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5237 to 5189. [2019-09-08 10:06:58,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5189 states. [2019-09-08 10:06:58,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5189 states to 5189 states and 8497 transitions. [2019-09-08 10:06:58,788 INFO L78 Accepts]: Start accepts. Automaton has 5189 states and 8497 transitions. Word has length 466 [2019-09-08 10:06:58,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:06:58,789 INFO L475 AbstractCegarLoop]: Abstraction has 5189 states and 8497 transitions. [2019-09-08 10:06:58,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:06:58,789 INFO L276 IsEmpty]: Start isEmpty. Operand 5189 states and 8497 transitions. [2019-09-08 10:06:58,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2019-09-08 10:06:58,810 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:06:58,811 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] [2019-09-08 10:06:58,811 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:06:58,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:06:58,812 INFO L82 PathProgramCache]: Analyzing trace with hash 806995065, now seen corresponding path program 1 times [2019-09-08 10:06:58,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:06:58,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:06:58,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:06:58,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:06:58,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:06:58,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:06:59,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:06:59,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:06:59,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:06:59,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:06:59,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:06:59,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:06:59,088 INFO L87 Difference]: Start difference. First operand 5189 states and 8497 transitions. Second operand 3 states. [2019-09-08 10:06:59,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:06:59,604 INFO L93 Difference]: Finished difference Result 15470 states and 25323 transitions. [2019-09-08 10:06:59,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:06:59,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 467 [2019-09-08 10:06:59,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:06:59,663 INFO L225 Difference]: With dead ends: 15470 [2019-09-08 10:06:59,664 INFO L226 Difference]: Without dead ends: 10333 [2019-09-08 10:06:59,678 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:06:59,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10333 states. [2019-09-08 10:06:59,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10333 to 5236. [2019-09-08 10:06:59,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5236 states. [2019-09-08 10:06:59,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5236 states to 5236 states and 8571 transitions. [2019-09-08 10:06:59,999 INFO L78 Accepts]: Start accepts. Automaton has 5236 states and 8571 transitions. Word has length 467 [2019-09-08 10:06:59,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:06:59,999 INFO L475 AbstractCegarLoop]: Abstraction has 5236 states and 8571 transitions. [2019-09-08 10:06:59,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:06:59,999 INFO L276 IsEmpty]: Start isEmpty. Operand 5236 states and 8571 transitions. [2019-09-08 10:07:00,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2019-09-08 10:07:00,019 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:07:00,019 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] [2019-09-08 10:07:00,020 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:07:00,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:07:00,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1222308475, now seen corresponding path program 1 times [2019-09-08 10:07:00,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:07:00,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:07:00,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:00,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:07:00,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:00,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:07:00,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:07:00,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:07:00,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:07:00,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:07:00,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:07:00,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:07:00,950 INFO L87 Difference]: Start difference. First operand 5236 states and 8571 transitions. Second operand 3 states. [2019-09-08 10:07:01,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:07:01,617 INFO L93 Difference]: Finished difference Result 15048 states and 24542 transitions. [2019-09-08 10:07:01,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:07:01,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 468 [2019-09-08 10:07:01,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:07:01,679 INFO L225 Difference]: With dead ends: 15048 [2019-09-08 10:07:01,679 INFO L226 Difference]: Without dead ends: 10211 [2019-09-08 10:07:01,694 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:07:01,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10211 states. [2019-09-08 10:07:02,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10211 to 10165. [2019-09-08 10:07:02,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10165 states. [2019-09-08 10:07:02,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10165 states to 10165 states and 16557 transitions. [2019-09-08 10:07:02,373 INFO L78 Accepts]: Start accepts. Automaton has 10165 states and 16557 transitions. Word has length 468 [2019-09-08 10:07:02,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:07:02,374 INFO L475 AbstractCegarLoop]: Abstraction has 10165 states and 16557 transitions. [2019-09-08 10:07:02,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:07:02,374 INFO L276 IsEmpty]: Start isEmpty. Operand 10165 states and 16557 transitions. [2019-09-08 10:07:02,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2019-09-08 10:07:02,402 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:07:02,402 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] [2019-09-08 10:07:02,403 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:07:02,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:07:02,403 INFO L82 PathProgramCache]: Analyzing trace with hash -600839798, now seen corresponding path program 1 times [2019-09-08 10:07:02,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:07:02,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:07:02,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:02,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:07:02,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:02,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:07:03,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:07:03,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:07:03,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:07:03,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:07:03,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:07:03,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:07:03,665 INFO L87 Difference]: Start difference. First operand 10165 states and 16557 transitions. Second operand 3 states. [2019-09-08 10:07:04,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:07:04,578 INFO L93 Difference]: Finished difference Result 30239 states and 49226 transitions. [2019-09-08 10:07:04,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:07:04,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 468 [2019-09-08 10:07:04,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:07:04,630 INFO L225 Difference]: With dead ends: 30239 [2019-09-08 10:07:04,630 INFO L226 Difference]: Without dead ends: 20218 [2019-09-08 10:07:04,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:07:04,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20218 states. [2019-09-08 10:07:05,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20218 to 10263. [2019-09-08 10:07:05,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10263 states. [2019-09-08 10:07:05,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10263 states to 10263 states and 16708 transitions. [2019-09-08 10:07:05,341 INFO L78 Accepts]: Start accepts. Automaton has 10263 states and 16708 transitions. Word has length 468 [2019-09-08 10:07:05,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:07:05,342 INFO L475 AbstractCegarLoop]: Abstraction has 10263 states and 16708 transitions. [2019-09-08 10:07:05,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:07:05,342 INFO L276 IsEmpty]: Start isEmpty. Operand 10263 states and 16708 transitions. [2019-09-08 10:07:05,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2019-09-08 10:07:05,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:07:05,369 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] [2019-09-08 10:07:05,369 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:07:05,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:07:05,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1594930186, now seen corresponding path program 1 times [2019-09-08 10:07:05,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:07:05,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:07:05,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:05,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:07:05,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:05,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:07:05,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:07:05,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:07:05,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:07:05,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:07:05,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:07:05,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:07:05,741 INFO L87 Difference]: Start difference. First operand 10263 states and 16708 transitions. Second operand 3 states. [2019-09-08 10:07:06,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:07:06,687 INFO L93 Difference]: Finished difference Result 30374 states and 49407 transitions. [2019-09-08 10:07:06,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:07:06,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 469 [2019-09-08 10:07:06,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:07:06,736 INFO L225 Difference]: With dead ends: 30374 [2019-09-08 10:07:06,737 INFO L226 Difference]: Without dead ends: 20335 [2019-09-08 10:07:06,763 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:07:06,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20335 states. [2019-09-08 10:07:07,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20335 to 10380. [2019-09-08 10:07:07,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10380 states. [2019-09-08 10:07:07,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10380 states to 10380 states and 16854 transitions. [2019-09-08 10:07:07,365 INFO L78 Accepts]: Start accepts. Automaton has 10380 states and 16854 transitions. Word has length 469 [2019-09-08 10:07:07,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:07:07,367 INFO L475 AbstractCegarLoop]: Abstraction has 10380 states and 16854 transitions. [2019-09-08 10:07:07,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:07:07,367 INFO L276 IsEmpty]: Start isEmpty. Operand 10380 states and 16854 transitions. [2019-09-08 10:07:07,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2019-09-08 10:07:07,393 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:07:07,393 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] [2019-09-08 10:07:07,394 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:07:07,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:07:07,394 INFO L82 PathProgramCache]: Analyzing trace with hash -243448576, now seen corresponding path program 1 times [2019-09-08 10:07:07,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:07:07,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:07:07,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:07,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:07:07,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:07,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:07:08,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:07:08,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:07:08,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:07:08,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:07:08,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:07:08,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:07:08,216 INFO L87 Difference]: Start difference. First operand 10380 states and 16854 transitions. Second operand 3 states. [2019-09-08 10:07:09,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:07:09,132 INFO L93 Difference]: Finished difference Result 29456 states and 47707 transitions. [2019-09-08 10:07:09,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:07:09,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 470 [2019-09-08 10:07:09,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:07:09,187 INFO L225 Difference]: With dead ends: 29456 [2019-09-08 10:07:09,187 INFO L226 Difference]: Without dead ends: 20045 [2019-09-08 10:07:09,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:07:09,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20045 states. [2019-09-08 10:07:10,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20045 to 20001. [2019-09-08 10:07:10,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20001 states. [2019-09-08 10:07:10,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20001 states to 20001 states and 32327 transitions. [2019-09-08 10:07:10,441 INFO L78 Accepts]: Start accepts. Automaton has 20001 states and 32327 transitions. Word has length 470 [2019-09-08 10:07:10,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:07:10,442 INFO L475 AbstractCegarLoop]: Abstraction has 20001 states and 32327 transitions. [2019-09-08 10:07:10,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:07:10,442 INFO L276 IsEmpty]: Start isEmpty. Operand 20001 states and 32327 transitions. [2019-09-08 10:07:10,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2019-09-08 10:07:10,487 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:07:10,487 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] [2019-09-08 10:07:10,488 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:07:10,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:07:10,488 INFO L82 PathProgramCache]: Analyzing trace with hash -539508643, now seen corresponding path program 1 times [2019-09-08 10:07:10,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:07:10,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:07:10,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:10,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:07:10,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:10,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:07:11,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:07:11,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:07:11,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:07:11,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:07:11,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:07:11,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:07:11,111 INFO L87 Difference]: Start difference. First operand 20001 states and 32327 transitions. Second operand 4 states. [2019-09-08 10:07:12,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:07:12,950 INFO L93 Difference]: Finished difference Result 55373 states and 89008 transitions. [2019-09-08 10:07:12,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:07:12,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 470 [2019-09-08 10:07:12,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:07:13,068 INFO L225 Difference]: With dead ends: 55373 [2019-09-08 10:07:13,068 INFO L226 Difference]: Without dead ends: 37652 [2019-09-08 10:07:13,116 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:07:13,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37652 states. [2019-09-08 10:07:15,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37652 to 21294. [2019-09-08 10:07:15,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21294 states. [2019-09-08 10:07:15,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21294 states to 21294 states and 34606 transitions. [2019-09-08 10:07:15,279 INFO L78 Accepts]: Start accepts. Automaton has 21294 states and 34606 transitions. Word has length 470 [2019-09-08 10:07:15,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:07:15,279 INFO L475 AbstractCegarLoop]: Abstraction has 21294 states and 34606 transitions. [2019-09-08 10:07:15,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:07:15,279 INFO L276 IsEmpty]: Start isEmpty. Operand 21294 states and 34606 transitions. [2019-09-08 10:07:15,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2019-09-08 10:07:15,316 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:07:15,316 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] [2019-09-08 10:07:15,317 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:07:15,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:07:15,317 INFO L82 PathProgramCache]: Analyzing trace with hash 252581075, now seen corresponding path program 1 times [2019-09-08 10:07:15,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:07:15,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:07:15,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:15,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:07:15,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:15,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:07:15,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:07:15,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:07:15,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:07:15,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:07:15,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:07:15,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:07:15,567 INFO L87 Difference]: Start difference. First operand 21294 states and 34606 transitions. Second operand 3 states. [2019-09-08 10:07:16,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:07:16,792 INFO L93 Difference]: Finished difference Result 56851 states and 91315 transitions. [2019-09-08 10:07:16,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:07:16,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 473 [2019-09-08 10:07:16,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:07:16,899 INFO L225 Difference]: With dead ends: 56851 [2019-09-08 10:07:16,900 INFO L226 Difference]: Without dead ends: 39110 [2019-09-08 10:07:16,927 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:07:16,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39110 states. [2019-09-08 10:07:18,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39110 to 21741. [2019-09-08 10:07:18,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21741 states. [2019-09-08 10:07:18,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21741 states to 21741 states and 35281 transitions. [2019-09-08 10:07:18,092 INFO L78 Accepts]: Start accepts. Automaton has 21741 states and 35281 transitions. Word has length 473 [2019-09-08 10:07:18,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:07:18,092 INFO L475 AbstractCegarLoop]: Abstraction has 21741 states and 35281 transitions. [2019-09-08 10:07:18,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:07:18,093 INFO L276 IsEmpty]: Start isEmpty. Operand 21741 states and 35281 transitions. [2019-09-08 10:07:18,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2019-09-08 10:07:18,115 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:07:18,115 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] [2019-09-08 10:07:18,116 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:07:18,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:07:18,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1266776201, now seen corresponding path program 1 times [2019-09-08 10:07:18,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:07:18,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:07:18,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:18,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:07:18,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:18,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:07:18,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:07:18,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:07:18,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:07:18,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:07:18,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:07:18,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:07:18,388 INFO L87 Difference]: Start difference. First operand 21741 states and 35281 transitions. Second operand 3 states. [2019-09-08 10:07:19,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:07:19,796 INFO L93 Difference]: Finished difference Result 57580 states and 92364 transitions. [2019-09-08 10:07:19,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:07:19,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 474 [2019-09-08 10:07:19,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:07:19,947 INFO L225 Difference]: With dead ends: 57580 [2019-09-08 10:07:19,947 INFO L226 Difference]: Without dead ends: 39725 [2019-09-08 10:07:19,989 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:07:20,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39725 states. [2019-09-08 10:07:21,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39725 to 22388. [2019-09-08 10:07:21,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22388 states. [2019-09-08 10:07:21,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22388 states to 22388 states and 36221 transitions. [2019-09-08 10:07:21,246 INFO L78 Accepts]: Start accepts. Automaton has 22388 states and 36221 transitions. Word has length 474 [2019-09-08 10:07:21,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:07:21,246 INFO L475 AbstractCegarLoop]: Abstraction has 22388 states and 36221 transitions. [2019-09-08 10:07:21,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:07:21,246 INFO L276 IsEmpty]: Start isEmpty. Operand 22388 states and 36221 transitions. [2019-09-08 10:07:21,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2019-09-08 10:07:21,271 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:07:21,272 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] [2019-09-08 10:07:21,272 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:07:21,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:07:21,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1149335967, now seen corresponding path program 1 times [2019-09-08 10:07:21,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:07:21,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:07:21,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:21,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:07:21,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:21,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:07:21,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:07:21,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:07:21,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:07:21,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:07:21,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:07:21,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:07:21,537 INFO L87 Difference]: Start difference. First operand 22388 states and 36221 transitions. Second operand 3 states. [2019-09-08 10:07:23,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:07:23,918 INFO L93 Difference]: Finished difference Result 58492 states and 93548 transitions. [2019-09-08 10:07:23,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:07:23,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 475 [2019-09-08 10:07:23,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:07:24,034 INFO L225 Difference]: With dead ends: 58492 [2019-09-08 10:07:24,034 INFO L226 Difference]: Without dead ends: 40579 [2019-09-08 10:07:24,060 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:07:24,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40579 states. [2019-09-08 10:07:25,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40579 to 23242. [2019-09-08 10:07:25,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23242 states. [2019-09-08 10:07:25,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23242 states to 23242 states and 37283 transitions. [2019-09-08 10:07:25,108 INFO L78 Accepts]: Start accepts. Automaton has 23242 states and 37283 transitions. Word has length 475 [2019-09-08 10:07:25,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:07:25,108 INFO L475 AbstractCegarLoop]: Abstraction has 23242 states and 37283 transitions. [2019-09-08 10:07:25,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:07:25,108 INFO L276 IsEmpty]: Start isEmpty. Operand 23242 states and 37283 transitions. [2019-09-08 10:07:25,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2019-09-08 10:07:25,133 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:07:25,134 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:07:25,134 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:07:25,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:07:25,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1200487636, now seen corresponding path program 1 times [2019-09-08 10:07:25,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:07:25,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:07:25,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:25,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:07:25,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:25,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:07:25,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:07:25,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:07:25,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:07:25,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:07:25,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:07:25,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:07:25,812 INFO L87 Difference]: Start difference. First operand 23242 states and 37283 transitions. Second operand 5 states. [2019-09-08 10:07:28,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:07:28,501 INFO L93 Difference]: Finished difference Result 43725 states and 69097 transitions. [2019-09-08 10:07:28,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:07:28,501 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 476 [2019-09-08 10:07:28,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:07:28,548 INFO L225 Difference]: With dead ends: 43725 [2019-09-08 10:07:28,549 INFO L226 Difference]: Without dead ends: 32092 [2019-09-08 10:07:28,573 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:07:28,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32092 states. [2019-09-08 10:07:30,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32092 to 32090. [2019-09-08 10:07:30,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32090 states. [2019-09-08 10:07:30,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32090 states to 32090 states and 50867 transitions. [2019-09-08 10:07:30,519 INFO L78 Accepts]: Start accepts. Automaton has 32090 states and 50867 transitions. Word has length 476 [2019-09-08 10:07:30,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:07:30,520 INFO L475 AbstractCegarLoop]: Abstraction has 32090 states and 50867 transitions. [2019-09-08 10:07:30,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:07:30,520 INFO L276 IsEmpty]: Start isEmpty. Operand 32090 states and 50867 transitions. [2019-09-08 10:07:30,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2019-09-08 10:07:30,545 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:07:30,545 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:07:30,545 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:07:30,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:07:30,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1910003993, now seen corresponding path program 1 times [2019-09-08 10:07:30,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:07:30,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:07:30,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:30,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:07:30,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:31,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:07:32,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:07:32,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:07:32,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 10:07:32,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 10:07:32,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 10:07:32,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-08 10:07:32,087 INFO L87 Difference]: Start difference. First operand 32090 states and 50867 transitions. Second operand 16 states. [2019-09-08 10:07:40,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:07:40,247 INFO L93 Difference]: Finished difference Result 57072 states and 89721 transitions. [2019-09-08 10:07:40,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 10:07:40,247 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 476 [2019-09-08 10:07:40,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:07:40,320 INFO L225 Difference]: With dead ends: 57072 [2019-09-08 10:07:40,320 INFO L226 Difference]: Without dead ends: 52151 [2019-09-08 10:07:40,344 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=331, Invalid=791, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 10:07:40,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52151 states. [2019-09-08 10:07:42,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52151 to 34606. [2019-09-08 10:07:42,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34606 states. [2019-09-08 10:07:42,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34606 states to 34606 states and 54535 transitions. [2019-09-08 10:07:42,529 INFO L78 Accepts]: Start accepts. Automaton has 34606 states and 54535 transitions. Word has length 476 [2019-09-08 10:07:42,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:07:42,530 INFO L475 AbstractCegarLoop]: Abstraction has 34606 states and 54535 transitions. [2019-09-08 10:07:42,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 10:07:42,530 INFO L276 IsEmpty]: Start isEmpty. Operand 34606 states and 54535 transitions. [2019-09-08 10:07:42,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2019-09-08 10:07:42,560 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:07:42,560 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:07:42,560 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:07:42,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:07:42,561 INFO L82 PathProgramCache]: Analyzing trace with hash 554075518, now seen corresponding path program 1 times [2019-09-08 10:07:42,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:07:42,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:07:42,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:42,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:07:42,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:43,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:07:43,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:07:43,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:07:43,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:07:43,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:07:43,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:07:44,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:07:44,000 INFO L87 Difference]: Start difference. First operand 34606 states and 54535 transitions. Second operand 4 states. [2019-09-08 10:07:48,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:07:48,909 INFO L93 Difference]: Finished difference Result 101839 states and 160482 transitions. [2019-09-08 10:07:48,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:07:48,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 476 [2019-09-08 10:07:48,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:07:48,968 INFO L225 Difference]: With dead ends: 101839 [2019-09-08 10:07:48,968 INFO L226 Difference]: Without dead ends: 67496 [2019-09-08 10:07:49,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:07:49,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67496 states. [2019-09-08 10:07:52,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67496 to 67456. [2019-09-08 10:07:52,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67456 states. [2019-09-08 10:07:52,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67456 states to 67456 states and 105861 transitions. [2019-09-08 10:07:52,732 INFO L78 Accepts]: Start accepts. Automaton has 67456 states and 105861 transitions. Word has length 476 [2019-09-08 10:07:52,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:07:52,732 INFO L475 AbstractCegarLoop]: Abstraction has 67456 states and 105861 transitions. [2019-09-08 10:07:52,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:07:52,732 INFO L276 IsEmpty]: Start isEmpty. Operand 67456 states and 105861 transitions. [2019-09-08 10:07:52,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2019-09-08 10:07:52,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:07:52,785 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:07:52,786 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:07:52,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:07:52,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1128589042, now seen corresponding path program 1 times [2019-09-08 10:07:52,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:07:52,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:07:52,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:52,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:07:52,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:52,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:07:53,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:07:53,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:07:53,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:07:53,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:07:53,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:07:53,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:07:53,200 INFO L87 Difference]: Start difference. First operand 67456 states and 105861 transitions. Second operand 3 states. [2019-09-08 10:08:02,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:08:02,055 INFO L93 Difference]: Finished difference Result 195839 states and 306268 transitions. [2019-09-08 10:08:02,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:08:02,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 478 [2019-09-08 10:08:02,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:08:02,203 INFO L225 Difference]: With dead ends: 195839 [2019-09-08 10:08:02,203 INFO L226 Difference]: Without dead ends: 131951 [2019-09-08 10:08:02,263 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:08:02,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131951 states. [2019-09-08 10:08:12,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131951 to 131913. [2019-09-08 10:08:12,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131913 states. [2019-09-08 10:08:12,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131913 states to 131913 states and 205831 transitions. [2019-09-08 10:08:12,411 INFO L78 Accepts]: Start accepts. Automaton has 131913 states and 205831 transitions. Word has length 478 [2019-09-08 10:08:12,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:08:12,411 INFO L475 AbstractCegarLoop]: Abstraction has 131913 states and 205831 transitions. [2019-09-08 10:08:12,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:08:12,412 INFO L276 IsEmpty]: Start isEmpty. Operand 131913 states and 205831 transitions. [2019-09-08 10:08:12,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2019-09-08 10:08:12,520 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:08:12,521 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:08:12,521 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:08:12,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:08:12,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1641276250, now seen corresponding path program 1 times [2019-09-08 10:08:12,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:08:12,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:08:12,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:08:12,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:08:12,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:08:12,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:08:12,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:08:12,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:08:12,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:08:12,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:08:12,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:08:12,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:08:12,964 INFO L87 Difference]: Start difference. First operand 131913 states and 205831 transitions. Second operand 3 states. [2019-09-08 10:08:30,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:08:30,394 INFO L93 Difference]: Finished difference Result 387458 states and 603621 transitions. [2019-09-08 10:08:30,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:08:30,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 478 [2019-09-08 10:08:30,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:08:30,672 INFO L225 Difference]: With dead ends: 387458 [2019-09-08 10:08:30,672 INFO L226 Difference]: Without dead ends: 259559 [2019-09-08 10:08:30,791 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:08:30,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259559 states. [2019-09-08 10:08:50,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259559 to 259523. [2019-09-08 10:08:50,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259523 states. [2019-09-08 10:08:51,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259523 states to 259523 states and 403125 transitions. [2019-09-08 10:08:51,139 INFO L78 Accepts]: Start accepts. Automaton has 259523 states and 403125 transitions. Word has length 478 [2019-09-08 10:08:51,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:08:51,140 INFO L475 AbstractCegarLoop]: Abstraction has 259523 states and 403125 transitions. [2019-09-08 10:08:51,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:08:51,140 INFO L276 IsEmpty]: Start isEmpty. Operand 259523 states and 403125 transitions. [2019-09-08 10:08:51,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2019-09-08 10:08:51,366 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:08:51,367 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:08:51,367 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:08:51,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:08:51,367 INFO L82 PathProgramCache]: Analyzing trace with hash -767378623, now seen corresponding path program 1 times [2019-09-08 10:08:51,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:08:51,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:08:51,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:08:51,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:08:51,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:08:51,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:08:51,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:08:51,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:08:51,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:08:51,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:08:51,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:08:51,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:08:51,766 INFO L87 Difference]: Start difference. First operand 259523 states and 403125 transitions. Second operand 3 states. [2019-09-08 10:09:28,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:09:28,620 INFO L93 Difference]: Finished difference Result 757839 states and 1174294 transitions. [2019-09-08 10:09:28,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:09:28,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 480 [2019-09-08 10:09:28,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:09:29,228 INFO L225 Difference]: With dead ends: 757839 [2019-09-08 10:09:29,229 INFO L226 Difference]: Without dead ends: 509992 [2019-09-08 10:09:29,439 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:09:29,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509992 states. [2019-09-08 10:10:14,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509992 to 509958. [2019-09-08 10:10:14,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509958 states. [2019-09-08 10:10:16,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509958 states to 509958 states and 788092 transitions. [2019-09-08 10:10:16,288 INFO L78 Accepts]: Start accepts. Automaton has 509958 states and 788092 transitions. Word has length 480 [2019-09-08 10:10:16,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:10:16,289 INFO L475 AbstractCegarLoop]: Abstraction has 509958 states and 788092 transitions. [2019-09-08 10:10:16,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:10:16,289 INFO L276 IsEmpty]: Start isEmpty. Operand 509958 states and 788092 transitions. [2019-09-08 10:10:16,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2019-09-08 10:10:16,734 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:10:16,734 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:10:16,735 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:10:16,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:10:16,735 INFO L82 PathProgramCache]: Analyzing trace with hash -838451170, now seen corresponding path program 1 times [2019-09-08 10:10:16,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:10:16,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:10:16,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:10:16,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:10:16,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:10:16,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:10:17,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:10:17,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:10:17,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:10:17,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:10:17,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:10:17,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:10:17,248 INFO L87 Difference]: Start difference. First operand 509958 states and 788092 transitions. Second operand 4 states. [2019-09-08 10:11:38,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:11:38,242 INFO L93 Difference]: Finished difference Result 1337540 states and 2049536 transitions. [2019-09-08 10:11:38,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:11:38,242 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 480 [2019-09-08 10:11:38,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:11:39,359 INFO L225 Difference]: With dead ends: 1337540 [2019-09-08 10:11:39,360 INFO L226 Difference]: Without dead ends: 933957 [2019-09-08 10:11:39,665 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:11:40,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933957 states. [2019-09-08 10:12:42,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933957 to 556870. [2019-09-08 10:12:42,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556870 states. [2019-09-08 10:12:43,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556870 states to 556870 states and 867122 transitions. [2019-09-08 10:12:43,444 INFO L78 Accepts]: Start accepts. Automaton has 556870 states and 867122 transitions. Word has length 480 [2019-09-08 10:12:43,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:12:43,444 INFO L475 AbstractCegarLoop]: Abstraction has 556870 states and 867122 transitions. [2019-09-08 10:12:43,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:12:43,445 INFO L276 IsEmpty]: Start isEmpty. Operand 556870 states and 867122 transitions. [2019-09-08 10:12:43,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2019-09-08 10:12:43,970 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:12:43,970 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:12:43,970 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:12:43,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:12:43,970 INFO L82 PathProgramCache]: Analyzing trace with hash -319048795, now seen corresponding path program 1 times [2019-09-08 10:12:43,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:12:43,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:12:43,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:12:43,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:12:43,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:12:44,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:12:44,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:12:44,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:12:44,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:12:44,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:12:44,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:12:44,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:12:44,524 INFO L87 Difference]: Start difference. First operand 556870 states and 867122 transitions. Second operand 4 states. [2019-09-08 10:14:23,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:14:23,123 INFO L93 Difference]: Finished difference Result 1533341 states and 2377374 transitions. [2019-09-08 10:14:23,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:14:23,123 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 482 [2019-09-08 10:14:23,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:14:24,371 INFO L225 Difference]: With dead ends: 1533341 [2019-09-08 10:14:24,371 INFO L226 Difference]: Without dead ends: 1031518 [2019-09-08 10:14:24,756 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:14:25,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031518 states. [2019-09-08 10:15:36,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031518 to 570711. [2019-09-08 10:15:36,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570711 states. [2019-09-08 10:15:37,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570711 states to 570711 states and 891755 transitions. [2019-09-08 10:15:37,190 INFO L78 Accepts]: Start accepts. Automaton has 570711 states and 891755 transitions. Word has length 482 [2019-09-08 10:15:37,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:15:37,191 INFO L475 AbstractCegarLoop]: Abstraction has 570711 states and 891755 transitions. [2019-09-08 10:15:37,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:15:37,191 INFO L276 IsEmpty]: Start isEmpty. Operand 570711 states and 891755 transitions. [2019-09-08 10:15:37,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2019-09-08 10:15:37,710 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:15:37,710 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:15:37,710 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:15:37,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:15:37,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1103837281, now seen corresponding path program 1 times [2019-09-08 10:15:37,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:15:37,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:15:37,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:37,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:15:37,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:15:37,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:15:37,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:15:37,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:15:37,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:15:37,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:15:37,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:15:37,938 INFO L87 Difference]: Start difference. First operand 570711 states and 891755 transitions. Second operand 3 states. [2019-09-08 10:17:12,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:17:12,950 INFO L93 Difference]: Finished difference Result 1474867 states and 2294975 transitions. [2019-09-08 10:17:12,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:17:12,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 487 [2019-09-08 10:17:12,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:17:14,210 INFO L225 Difference]: With dead ends: 1474867 [2019-09-08 10:17:14,210 INFO L226 Difference]: Without dead ends: 1022476 [2019-09-08 10:17:14,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:17:15,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022476 states.